Sciweavers

193 search results - page 3 / 39
» Fair Public-Key Cryptosystems
Sort
View
IMA
1999
Springer
108views Cryptology» more  IMA 1999»
13 years 10 months ago
Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product. Using these trapdoors we set up a lattice-based cryptosystem which ...
Roger Fischlin, Jean-Pierre Seifert
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
IJNSEC
2006
132views more  IJNSEC 2006»
13 years 5 months ago
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
Sahadeo Padhye, Birendra Kumar Sharma
EUROCRYPT
2000
Springer
13 years 9 months ago
Fair Encryption of RSA Keys
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when the...
Guillaume Poupard, Jacques Stern
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 5 months ago
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...