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

Motoki Kitahara, Takanori Yasuda, Takashi Nishide, Kouichi Sakurai

研究成果: 著書/レポートタイプへの貢献会議での発言

3 引用 (Scopus)

抜粋

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.

元の言語英語
ホスト出版物のタイトルAsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography
ページ33-38
ページ数6
DOI
出版物ステータス出版済み - 5 27 2013
イベント1st ACM Workshop on Asia Public-Key Cryptography, AsiaPKC 2013 - Hangzhou, 中国
継続期間: 5 8 20135 8 2013

その他

その他1st ACM Workshop on Asia Public-Key Cryptography, AsiaPKC 2013
中国
Hangzhou
期間5/8/135/8/13

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

これを引用

Kitahara, M., Yasuda, T., Nishide, T., & Sakurai, K. (2013). Upper bound of the length of information embedd in RSA public key efficiently. : AsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography (pp. 33-38) https://doi.org/10.1145/2484389.2484396