### Table 1. Technical components

### Table 1: Technical data

### Table 1: Notation to be used in technical presentation The remainder of this paper is organised as follows. Table 1 lists the nota- tion to be used in the technique presentation. Section 2 introduces the technical basis of our method. Section 3 presents several protocols for nancial transac- tions. Section 4 discusses why and how the three essential requirements are met. Finally, Section 5 forms our conclusion. 2 Use of Centrally-stored One-way Hashed Pass- words Modular exponentiation forms a family of one-way hash functions used fre- quently in cryptography. Calculating the following expression is easy: x mod The inverse problem of modular exponentiation is that of nding the discrete logarithm of a number:

1995

"... In PAGE 6: ... Let R represent a message containing su cient redundant information, including the names of the client and the merchant; for instance, R can be a purchase billing order: \Debit ve pounds from C apos;s account no 123 in Fc and deposit it to M apos;s account no 321 in Fm quot;. Finally, for notation Kxy, H(message), Sf(message) and \ quot;, please see Table1 in Section 1. Now we are ready to specify the protocol for purchase transaction.... ..."

Cited by 1

### Table 1: Notation to be used in technical presentation The remainder of this paper is organised as follows. Table 1 lists the nota- tion to be used in the technique presentation. Section 2 introduces the technical basis of our method. Section 3 presents several protocols for nancial transac- tions. Section 4 discusses why and how the three essential requirements are met. Finally, Section 5 forms our conclusion. 2 Use of Centrally-stored One-way Hashed Pass- words Modular exponentiation forms a family of one-way hash functions used fre- quently in cryptography. Calculating the following expression is easy: x mod The inverse problem of modular exponentiation is that of nding the discrete logarithm of a number:

1995

"... In PAGE 6: ... Let R represent a message containing su cient redundant information, including the names of the client and the merchant; for instance, R can be a purchase billing order: \Debit ve pounds from C apos;s account no 123 in Fc and deposit it to M apos;s account no 321 in Fm quot;. Finally, for notation Kxy, H(message), Sf(message) and \ quot;, please see Table1 in Section 1. Now we are ready to specify the protocol for purchase transaction.... ..."

Cited by 1

### Table 1: FI/BI solution cost and CPU time ratios FI/BI FI/BI

2005

"... In PAGE 3: ... We have implemented the FI and BI variants of 2-opt and Or-opt on 1000 random and planar 100-vertex instances starting from an arbitrary solution. Our results are summarized in Table1 . Following these tests we have opted to conduct all our experiments with FI which generally provides better costs with Or-opt.... ..."