TY - GEN
T1 - Unbelievable security : Matching AES using public key systems
AU - Lenstra, A.K.
PY - 2001
Y1 - 2001
N2 - The Advanced Encryption Standard (AES) provides three levels of security: 128, 192, and 256 bits. Given a desired level of security for the AES, this paper discusses matching public key sizes for RSA and the ElGamal family of protocols. For the latter both traditional multiplicative groups of finite fields and elliptic curve groups are considered. The practicality of the resulting systems is commented upon. Despite the conclusions, this paper should not be interpreted as an endorsement of any particular public key system in favor of any other.
AB - The Advanced Encryption Standard (AES) provides three levels of security: 128, 192, and 256 bits. Given a desired level of security for the AES, this paper discusses matching public key sizes for RSA and the ElGamal family of protocols. For the latter both traditional multiplicative groups of finite fields and elliptic curve groups are considered. The practicality of the resulting systems is commented upon. Despite the conclusions, this paper should not be interpreted as an endorsement of any particular public key system in favor of any other.
U2 - 10.1007/3-540-45682-1_5
DO - 10.1007/3-540-45682-1_5
M3 - Conference contribution
SN - 3-540-42987-5
T3 - Lecture Notes in Computer Science
SP - 67
EP - 86
BT - Advances in Cryptology - Asiacrypt 2001 (Proceedings 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9-13, 2001)
A2 - Boyd, C.
PB - Springer
CY - Berlin
ER -