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

Fingerprint

Cryptography

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Cite this

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

Upper bound of the length of information embedd in RSA public key efficiently. / Kitahara, Motoki; Yasuda, Takanori; Nishide, Takashi; Sakurai, Kouichi.

AsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography. 2013. p. 33-38.

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

Kitahara, M, Yasuda, T, Nishide, T & Sakurai, K 2013, Upper bound of the length of information embedd in RSA public key efficiently. in AsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography. pp. 33-38, 1st ACM Workshop on Asia Public-Key Cryptography, AsiaPKC 2013, Hangzhou, China, 5/8/13. https://doi.org/10.1145/2484389.2484396
Kitahara M, Yasuda T, Nishide T, Sakurai K. Upper bound of the length of information embedd in RSA public key efficiently. In AsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography. 2013. p. 33-38 https://doi.org/10.1145/2484389.2484396
Kitahara, Motoki ; Yasuda, Takanori ; Nishide, Takashi ; Sakurai, Kouichi. / 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. 2013. pp. 33-38
@inproceedings{6c84e03a9eed4c46819bec56e7c783c3,
title = "Upper bound of the length of information embedd in RSA public key efficiently",
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.",
author = "Motoki Kitahara and Takanori Yasuda and Takashi Nishide and Kouichi Sakurai",
year = "2013",
month = "5",
day = "27",
doi = "10.1145/2484389.2484396",
language = "English",
isbn = "9781450320696",
pages = "33--38",
booktitle = "AsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography",

}

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/5/27

Y1 - 2013/5/27

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

SP - 33

EP - 38

BT - AsiaPKC 2013 - Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography

ER -