Weak-keys in public key cryptosystems based on discrete logarithms
نویسندگان
چکیده
منابع مشابه
Public Key Cryptosystems with Noisy Secret Keys
Passwords bootstrap symmetric and asymmetric cryptography, tying keys to an individual user. Biometrics are intended to strengthen this tie. Unfortunately, biometrics exhibit noise between repeated readings. Fuzzy extractors (Dodis et al., Eurocrypt 2004) derive stable symmetric keys from noisy sources. We ask if it is also possible for noisy sources to directly replace private keys in asymmetr...
متن کاملSecure Key-Evolving for Public Key Cryptosystems Based on the Discrete Logarithm Problem
391 Receiveed June 24, 2002; revised November 15, 2002; accepted April 21, 2003. Communicated by Chi Sung Laih. * An earlier version of this paper has been published in the RSA Conference 2002, USA. This work is supported in part by Ministry of Education, National Science Council of Taiwan, and Lee & MTI Center, National Chiao Tung University. + This work was done while the first author was wit...
متن کاملComparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کاملWeak keys in the McEliece public-key cryptosystem
We show that it is possible to know whether the secret Goppa code of an instance of the McEliece public-key cryptosystem was chosen with a binary generator polynomial. Furthermore, whenever such a weak key is used, we present an attack which can be completed, for codes of length 1024 and dimension 524, with a large, but feasible amount of computation.
متن کاملMultisignature Scheme Based on Discrete Logarithms in the Plain Public Key Model
In this paper, we propose a new multisignature scheme based on discrete logarithms. We show that this new scheme can resist existential forgeries against adaptive chosen-message attacks in the random oracle model. The main contribution is that our security model gets rid of the special security requirement on the generation of the signers’ public keys. Adversaries are not required to reveal pri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsinghua Science and Technology
سال: 2005
ISSN: 1007-0214
DOI: 10.1016/s1007-0214(05)70121-8