Download:
|
by David Grant, Kate Krastev, Daniel Lieman, Igor Shparlinski
http://www.cs.mq.edu.au/~igor/GKLS.ps
Add To MetaCart
Abstract:
Abstract. This paper introduces a new type of cryptosystem which is based on sparse polynomials over finite fields. We evaluate its theoretic characteristics and give some security analysis. Some preliminary timings are presented as well, which compare quite favourably with published optimized RSA timings. We believe that similar ideas can be used in some other settings as well. 1
Citations
|
2110
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
97
|
On fast multiplication of polynomials over arbitrary algebras
– Cantor, Kaltofen
- 1991
|
|
49
|
Algebraic Aspects of Cryptography
– Koblitz
- 1998
|
|
23
|
Modifications to the number field sieve
– Coppersmith
- 1993
|
|
22
|
Finite fields: theory and computation
– Shparlinski
- 1999
|
|
21
|
NTL: A library for doing number theory (version 3.1b). Link on web document http://www.cs. wisc.edu/~shoup
– Shoup
- 1998
|
|
20
|
Asymmetric Cryptography with a Hidden Monomial
– Patarin
- 1996
|
|
18
|
On the statistical properties of Diffie-Hellman distributions
– Canetti, Friedlander, et al.
- 2000
|
|
17
|
On the evaluation of powers
– Yao
- 1976
|
|
16
|
On the evaluation of powers and monomials
– Pippenger
- 1980
|
|
8
|
Solvability of systems of polynomial congruences modulo a large prime
– Huang, Wong
- 1999
|
|
7
|
Improved algorithms for Isomorphisms of Polynomials
– Patarin, Goubin, et al.
- 1998
|
|
4
|
On correlation of binary M-sequences', Designs, Codes and Cryptography
– Friedlander, Larsen, et al.
- 1996
|
|
1
|
The NTRU public key cryptosystem: Operating characteristics and comparison with RSA, ElGamal, and ECC cryptosystems
– Cryptosystems, Inc
- 1998
|
