Abstract
Lenstra proposed a method by which information can be efficiently in a public key N in RSA encryption. Since then, many methods such as the additional key escrow function and a visible public key have been proposed. Lenstra made an assertion that the size of embeddable information is up to half the length of a public key, but he did not mention the strict upper bound of the size. In this paper, we analytially examine the Lenstra algorithm both in theory and implementation, and calcuate the upper bound of the size of information that can be efficiently embedded in an RSA public key.
Original language | English |
---|---|
Title of host publication | AsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography |
Pages | 33-38 |
Number of pages | 6 |
DOIs | |
Publication status | Published - May 27 2013 |
Event | 1st ACM Workshop on Asia Public-Key Cryptography, AsiaPKC 2013 - Hangzhou, China Duration: May 8 2013 → May 8 2013 |
Other
Other | 1st ACM Workshop on Asia Public-Key Cryptography, AsiaPKC 2013 |
---|---|
Country | China |
City | Hangzhou |
Period | 5/8/13 → 5/8/13 |
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Software