The Vanstone-Zuccherato Schemes Revisited

Naoki KANAYAMA  Shigenori UCHIYAMA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E90-A   No.12   pp.2903-2907
Publication Date: 2007/12/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e90-a.12.2903
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Information Security
integer factorization,  RSA cryptosystem,  Coppersmith's algorithm,  

Full Text: PDF(156.8KB)>>
Buy this Article

In 1995, Vanstone and Zuccherato proposed a novel method of generating RSA moduli having a predetermined set of bits which are the ASCII representation of user's identification information (i.e., name, email address, etc.). This could lead to a savings in bandwidth for data transmission and storage. In this paper, we apply this idea of Vanstone and Zuccherato for reducing the storage requirement of RSA public moduli to integer factoring based public-key schemes with their moduli of the form prq. More precisely, we explicitly propose two efficient methods for specifying high-order bits of prime factors of their public-keys. We also consider the security of the proposed methods.