103 search results - page 1 / 21 » Security of public key cryptosystems based on Chebyshev Poly... |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
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...
ARTCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
SACRYPT
1998
Springer
13 years 8 months ago
1998
Springer
In 1998, Cai and Cusick proposed a lattice-based public-key cryptosystem based on the similar ideas of the Ajtai-Dwork cryptosystem, but with much less data expansion. However, th...
CSJM
2008
13 years 4 months ago
2008
In 1993 Koblitz and Fellows proposed a public key cryptosystem, Polly Cracker, based on the problem of solving multivariate systems of polynomial equations, which was soon general...
EUROCRYPT
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...