Sciweavers

140 search results - page 4 / 28
» Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomi...
Sort
View
JOC
2007
125views more  JOC 2007»
13 years 5 months ago
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
Jean-Sébastien Coron, Alexander May
ICICS
1999
Springer
13 years 10 months ago
Reaction Attacks against several Public-Key Cryptosystems
Abstract. We present attacks against the McEliece Public-Key Cryptosystem, the Atjai-Dwork Public-Key Cryptosystem, and variants of those systems. Most of these systems base their ...
Chris Hall, Ian Goldberg, Bruce Schneier
BIRTHDAY
2012
Springer
12 years 1 months ago
Secret Key Leakage from Public Key Perturbation of DLP-Based Cryptosystems
Finding efficient countermeasures for cryptosystems against fault attacks is challenged by a constant discovery of flaws in designs. Even elements, such as public keys, that do no...
Alexandre Berzati, Cécile Canovas-Dumas, Lo...
ECCC
2008
98views more  ECCC 2008»
13 years 5 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
INDOCRYPT
2005
Springer
13 years 11 months ago
Completion Attacks and Weak Keys of Oleshchuk's Public Key Cryptosystem
This paper revisits a public key cryptosystem which is based on finite string-rewriting systems. We consider a new approach for cryptanalysis of such proposals—the so-called com...
Heiko Stamer