Unbelievable Security: Matching AES security using public key systems (2001)
| Venue: | PROCEEDINGS ASIACRYPT 2001, LNCS 2248, SPRINGER-VERLAG 2001, 67–86 |
| Citations: | 25 - 1 self |
BibTeX
@INPROCEEDINGS{Lenstra01unbelievablesecurity:,
author = {Arjen K. Lenstra},
title = {Unbelievable Security: Matching AES security using public key systems},
booktitle = {PROCEEDINGS ASIACRYPT 2001, LNCS 2248, SPRINGER-VERLAG 2001, 67–86},
year = {2001},
pages = {67--86},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
