The Vanstone-Zuccherato Schemes Revisited(Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
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 p^rq. 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.
- 2007-12-01
著者
-
Kanayama Naoki
Department of Bioscience and Biotechnology, Graduate School of Natural Science and Technology, Okaya
-
UCHIYAMA Shigenori
Tokyo Metropolitan University
-
Kanayama Naoki
Department Of Bioscience And Biotechnology Graduate School Of Natural Science And Technology Okayama
-
Kanayama Naoki
Univ. Tsukuba Tsukuba‐shi Jpn
関連論文
- Conditional transformation of immunoglobulin mutation pattern from gene conversion into point mutation by controlling XRCC3 expression in the DT40 B cell line(CELL AND TISSUE ENGINEERING)
- Efficient affinity maturation of antibodies in an engineered chicken B cell line DT40-SW by increasing point mutation
- The Vanstone-Zuccherato Schemes Revisited(Information Security)
- Efficient affinity maturation of antibodies in an engineered chicken B cell line DT40-SW by increasing point mutation(CELL AND TISSUE ENGINEERING)
- Optimised Versions of the Ate and Twisted Ate Pairings
- Conditional transformation of immunoglobulin mutation pattern from gene conversion into point mutation by controlling XRCC3 expression in the DT40 B cell line
- Enhancement of antibody production from a chicken B cell line DT40 by reducing Pax5 expression(MEDICAL BIOTECHNOLOGY)
- Novel In Vitro Screening System for Monoclonal Antibodies Using Hypermutating Chicken B Cell Library(METHOD)
- Optimised Versions of the Ate and Twisted Ate Pairings
- Analysis of Baby-Step Giant-Step Algorithms for Non-uniform Distributions (Fundamental) (Cryptography and Information Security)
- Generating Secure Genus Two Hyperelliptic Curves Using Elkies' Point Counting Algorithm
- Simple Remarks on Carmichael Numbers
- On Patarin's Attack against the lIC Scheme
- On the reduction attack against the algebraic surface public-key cryptosystem(ASC04)
- Scalar Multiplication on Pairing Friendly Elliptic Curves
- A Note on the Pairing Computation Using Normalized Miller Functions
- Implementation of an Elliptic Curve Scalar Multiplication Method Using Division Polynomials
- An integer factoring algorithm based on elliptic divisibility sequences