140 search results - page 1 / 28 » Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomi... |
ARTCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
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...
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...
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...
PQCRYPTO
2010
13 years 8 months ago
2010
Abstract. In this paper a new structural attack on the McEliece/Niederreiter public key cryptosystem based on subcodes of generalized ReedSolomon codes proposed by Berger and Loidr...