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

Authors:
Motoki Kitahara;Takanori Yasuda;Takashi Nishide;Kouichi Sakurai
Affiliations:
Kyushu University, Fukuoka, Japan;Institute of Systems, Information Technologies and Nanotechnologies, Fukuoka, Japan;Kyushu University, Fukuoka, Japan;Kyushu University, Fukuoka, Japan
Venue:
Proceedings of the first ACM workshop on Asia public-key cryptography
Year:
2013

Citing 4
Cited 0

Generating RSA Moduli with a Predetermined Portion

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Generating visible RSA public keys for PKI

International Journal of Information Security
RSA moduli with a predetermined portion: techniques and applications

ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
A Method for Embedding Secret Key Information in RSA Public Key and Its Application

IMIS '12 Proceedings of the 2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

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.