### Table 9.3 shows that a 500-bit ECC encrypted message, when point compression is used, is almost as long as a 500-bit message encrypted with RSA. ECC encryption

### Table 1. RSA, XTR, ECC key sizes and RSA, XTR run times. shared ID-based non-ID-based key encrypting decrypting

2000

"... In PAGE 15: ...f high order. Using methods similar to the one alluded to in Subsection 3.3 this can be reduced to an overhead of, say, 48 bits (to generate curve and fleld based on the ID and 48 bits) plus 85 bits for the group order information. For XTR the sizes given in Table1 follow from Subsection 3.3.... In PAGE 15: ...able 2. 170-bit ECC, XTR comparison of number of multiplications in GF(p). encrypting decrypting encryption signing verifying signature DH speed DH size overhead overhead ECC 3400 1921 (1700) 171 (340) bits 1700 2575 170 bits 3842 (3400) 171 (340) bits XTR 2720 1360 340 bits 1360 2754 170 bits 2720 340 bits and XTR 100 random keys were generated. (ECC parameter generation is much slower and more complicated than for either RSA or XTR and not included in Table1 .) For RSA we used random 32-bit odd public exponents and 1020-bit moduli picked by randomly selecting 510-bit odd numbers and adding 2 until they are prime.... In PAGE 15: ...2. For each RSA key 10 encryptions and decryptions of random 1020-bit messages were carried out, the latter with Chinese remaindering (CRT) and without (in parentheses in Table1 ). For each XTR key 10 single and double exponentiations (i.... ..."

Cited by 61

### Table 1 gives the computational energy cost for RSA encryption/decryption, DSA data signing/verification, and ElGamal encryption/decryption on five microprocessors. It is obtained by first estimating the energy cost for computing the 128-bit multiply function, the basic building block for most data encryption proto- cols, at the reference 3.3v, and then multiplying by the number of 128-bit multiplications required by each computation (see [4] for details).

2002

"... In PAGE 3: ... Table1 . Energy consumption for data encryption protocols at 3.... In PAGE 6: ... When a message misses its deadline, it has to be dropped. We generate a sequence of messages using the above parameters and conduct two simulations for each type of processor reported in Table1 . First on the traditional processor operating at 3.... ..."

Cited by 11

### Table 1 Benchmarks for RSA and DSA algorithms, based on a 1024-bit RSA modulus and a 1024-bit DSA p parameter

2004

"... In PAGE 9: ... The use of cryptography adds an overhead of CPU cycles for each Update message, both for verification and for signing. The values of Table1 in the 200 MHz need to be considered in light of measurements we made of Update processing costs on a BGP speaker at Dartmouth College. 4 We observed Update costs ranging from 32.... In PAGE 9: ...5 ms. Table1 shows then that cryptographic overhead is very significant. Prior work recognized this as a potential problem, and proposed some methods for improve- SHA-1 time, 200 MHz (ls) 7.... ..."

### Table 1: Measured performance of public-key algorithms. ECC-160 RSA-1024 ECC-224 RSA-2048

2004

"... In PAGE 2: ... RSA decryption and ECDH operations represent the most com- putationally intensive portion in a typical SSL handshake. Perfor- mance measurements for these operations ( Table1 ) illustrate the advantage of ECC over RSA and show that advantage growing as security needs increase. In addition to public-key computations, secure webservers incur the cost of message parsing, file system accesses, and symmetric- key encryption and hashing.... ..."

Cited by 2

### Table 9: DES encryption and decryption times (ms).

"... In PAGE 20: ...) Table 8 shows the computation times of two message digest functions, MD5 [28] and SHS [24]. Table9 shows the encryption and decryption times of DES symmetric cryptosystem [23]. Table 10 shows the signing and veri cation times of RSA [29] and DSA [25] digital signature schemes.... ..."

### 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 3 summarizes the costs involved in our scheme. We performed our benchmarks under different conditions. First, we did measurements where all communications within the system we based either on TCP or UDP. For each transport, we also measured the costs involved in the tracing scheme when individual traces have messages authorization information (and assorted processing) and cases where the trace messages have authorization information and are also secured. In our experiments for the purposes of signing we used 1024-bit RSA with 160- bit SHA-1 and PKCS#1Padding. For symmetric encryptions and decryptions we used 192-bit AES keys.

"... In PAGE 8: ...-hops 140.79 40.12 8.97 Table3 : Summary of costs involved in the tracking framework: All results in milliseconds. Figure 2: Trace Routing Overhead vs.... ..."

Cited by 1

### Table 3. Computation speed of some encryption algorithms.

"... In PAGE 3: ...ecryption reproduces the original message (Fig. 3). Examples of symmetric-key encryption systems are DES [20], AES [21], and IDEA [18]. Table3 lists measurements for commonly used symmetric encryption algorithms. P u b lic-Key Encryption: Public-key encryption (also called asymmetric encryption) involves a pair of keys (a public key and a private key) associated with the sender.... ..."

### Table 3. Properties of authenticated encryption algorithms

2007

"... In PAGE 8: ...Since the late 1990s, there has been increased interest in protocols that se- curely provide encryption and authentication using a single key; there are collec- tively called authenticated encryption (AE) protocols. Black provides a concise introduction to AE algorithms in [17] and a summary of their properties is shown in Table3 . Single- or dual-pass AE, as the name suggests, refers to the times the message needs to be processed.... ..."

Cited by 2