TY - GEN
T1 - Upper bound of the length of information embedd in RSA public key efficiently
AU - Kitahara, Motoki
AU - Yasuda, Takanori
AU - Nishide, Takashi
AU - Sakurai, Kouichi
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84877933605&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84877933605&partnerID=8YFLogxK
U2 - 10.1145/2484389.2484396
DO - 10.1145/2484389.2484396
M3 - Conference contribution
AN - SCOPUS:84877933605
SN - 9781450320696
T3 - AsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography
SP - 33
EP - 38
BT - AsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography
T2 - 1st ACM Workshop on Asia Public-Key Cryptography, AsiaPKC 2013
Y2 - 8 May 2013 through 8 May 2013
ER -