Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1093/ietfec/e90-a.12.2903 | IEICE Transactions |
Keywords | Field | DocType |
email address,storage requirement,high-order bit,efficient method,ascii representation,data transmission,rsa public modulus,form prq,rsa modulus,vanstone-zuccherato schemes revisited | Integer,Discrete mathematics,Data transmission,Identification (information),Theoretical computer science,Bandwidth (signal processing),Prime factor,ASCII,Mathematics,Factoring,Integer factorization | Journal |
Volume | Issue | ISSN |
E90-A | 12 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Naoki Kanayama | 1 | 139 | 19.29 |
| Shigenori Uchiyama | 2 | 371 | 40.90 |