The Vanstone-Zuccherato Schemes Revisited
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.12 pp.2903-2907
- Publication Date
- 2007/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e90-a.12.2903
- Type of Manuscript
- PAPER
- Category
- Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Naoki KANAYAMA, Shigenori UCHIYAMA, "The Vanstone-Zuccherato Schemes Revisited" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 12, pp. 2903-2907, December 2007, doi: 10.1093/ietfec/e90-a.12.2903.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.12.2903/_p
Copy
@ARTICLE{e90-a_12_2903,
author={Naoki KANAYAMA, Shigenori UCHIYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Vanstone-Zuccherato Schemes Revisited},
year={2007},
volume={E90-A},
number={12},
pages={2903-2907},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e90-a.12.2903},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - The Vanstone-Zuccherato Schemes Revisited
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2903
EP - 2907
AU - Naoki KANAYAMA
AU - Shigenori UCHIYAMA
PY - 2007
DO - 10.1093/ietfec/e90-a.12.2903
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2007
AB - 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.
ER -
English
