Upper bound of the length of information embedd in RSA public key efficiently

Motoki Kitahara, Takanori Yasuda, Takashi Nishide, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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 languageEnglish
Title of host publicationAsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography
Pages33-38
Number of pages6
DOIs
Publication statusPublished - May 27 2013
Event1st ACM Workshop on Asia Public-Key Cryptography, AsiaPKC 2013 - Hangzhou, China
Duration: May 8 2013May 8 2013

Other

Other1st ACM Workshop on Asia Public-Key Cryptography, AsiaPKC 2013
CountryChina
CityHangzhou
Period5/8/135/8/13

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Fingerprint Dive into the research topics of 'Upper bound of the length of information embedd in RSA public key efficiently'. Together they form a unique fingerprint.

Cite this