### Table 1: A comparison of public-key cryptosystems [16].

2004

"... In PAGE 2: ... The relative difficulty of solving that problem determines the security strength of the corre- sponding system. Table1 summarizes three types of well known public-key cryptosystems. As shown in the last column, RSA, Diffie-Hellman and DSA can all be attacked using sub-exponential algorithms, but the best known attack on ECC requires exponential time.... ..."

Cited by 11

### Table 1. A comparison of public-key cryptosystems [30]. Public-key system Examples Mathematical Problem Best known method for

"... In PAGE 2: ... The relative difficulty of solving that problem de- termines the security strength of the corresponding system. Table1 summarizes three types of well known public-key cryptosystems. As shown in the last column, RSA, Diffie- Hellman and DSA can all be attacked using sub-exponential algorithms, but the best known attack on ECC requires ex- ponential time.... ..."

### Table 2. Applications for Public-key Cryptosystems Algorithm Encryption/Decryption Digital Signature Key Exchange

2005

"... In PAGE 8: ...able 1. Type of Attacks on Encrypted Messages ........................................................... 11 Table2 .... In PAGE 22: ...14 Figure 9. Example of Asymmetric Encryption, Encrypting M with KPublic Example of a commonly used asymmetric encryption algorithm is the RSA algorithm, used as an example for key distribution, PKI, digital signatures and other security mechanisms as shown in Table2 . [20] Table 2.... ..."

### Table 1 Execution times for public key cryptosystem verifi- cations and hash calculations

"... In PAGE 8: ... The cryptographic library of the SECUDE toolkit [9] is used. Table1 gives these measurements. The behavior of the speed-up factor, f .... In PAGE 8: ... 3 and 4, the effect of the MD5 hash algorithm over the speed-up factor is better than the effect of the SHA-1 hash algorithm for the same cryptosystems. The throughput of the MD5 algorithm is greater than the one of the SHA-1 algorithm and the setup times are almost the same in both cases, as can be seen from Table1 . The effect of the MD5 algorithm over the speed-up factor is... In PAGE 15: ... (22). The tSHA-1, tRSA512 and the SHA-1 values of Table1 are used. As can be seen from Fig.... ..."

### Table 2: Processing overhead of various cryptosystems (on iPAQ3670 pocket PC with Intel StrongARM 206MHz CPU)

"... In PAGE 9: ... The processing overhead used in our simulation is based on ac- tual measurement on a low-end device. Table2 shows the perfor- mance of different cryptosystems. For public key cryptosystems, the table shows processing latency per operation.... ..."

### Table 2: Processing overhead of various cryptosystems (on iPAQ3670 pocket PC with Intel StrongARM 206MHz CPU)

"... In PAGE 9: ... The processing overhead used in our simulation is based on ac- tual measurement on a low-end device. Table2 shows the perfor- mance of different cryptosystems. For public key cryptosystems, the table shows processing latency per operation.... ..."

### Table 2. Measurements of Computation Delay in RSA cryptosystem

2002

"... In PAGE 9: ...We use RSA cryptographic primitives to realize the public key cryptosystem in our design. The result shown in Table2 illustrates the performance of RSA cryptosystem are not prohibitively expensive even for the low-end device. Thus leveraging PKI-based ap- proaches into wireless ad-hoc networks is an accept- able solution.... ..."

Cited by 27

### Table 2. Measurements of Computation Delay in RSA cryptosystem

2002

"... In PAGE 9: ...We use RSA cryptographic primitives to realize the public key cryptosystem in our design. The result shown in Table2 illustrates the performance of RSA cryptosys- tem are not prohibitively expensive even for the low- end device. Thus leveraging PKI-based approaches into wireless ad-hoc networks is an acceptable solution.... ..."

Cited by 27

### Table 1: Computationally equivalent key sizes. Symmetric ECC RSA/DH/DSA

2002

"... In PAGE 1: ... The security of a system is only as good as that of its weakest component; for this reason, the work factor needed to break a symmetric key must match that needed to break the public-key cryptosystem used for key establish- ment. Due to expected advances in cryptanalysis and in- creases in computing power available to an adversary, both symmetric and public-key sizes must grow over time to of- fer acceptable security for a xed protection life span, and Table1 [3] shows this expected key-size growth for various symmetric and public-key cryptosystems. Table 1: Computationally equivalent key sizes.... In PAGE 1: ...As shown in Table1 , the Elliptic Curve Cryptosystem (ECC), o ers the highest strength per bit of any known public-key cryptosystem today. ECC not only uses smaller keys for equivalent strength compared to traditional public- key cryptosystems like RSA, the key size disparity grows as security needs increase.... In PAGE 5: ... Already, there is signi cant momentum behind widespread adoption of the Advanced Encryption Standard (AES) which speci- es the use of 128-bit, 192-bit and 256-bit symmetric keys. As indicated in Table1 , key sizes for public key cryptosys- tems used to establish AES keys will also need to increase from current levels. We believe this trend bodes well for the future of Elliptic Curve Cryptography and not just for wireless environments.... ..."

Cited by 18

### Table 7: Public-key algorithms in mCrypt

"... In PAGE 4: ...1. Workload characteristics We use the SimpleScalar toolset to profile the public- key algorithms included in mCrypt, which are listed in Table7 . Table 8 shows the breakdown of execution times at the macro-operation level.... ..."