Name
Abstract | ||
|---|---|---|
The Naor-Reingold sequences with elliptic curves are used in cryptography due to their nice construction and good theoretical properties. Here we provide a new bound on the linear complexity of these sequences. Our result improves the previous one obtained by I.E. Shparlinski and J.H. Silverman and holds in more cases. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ffa.2010.05.005 | Finite Fields and Their Applications |
Keywords | Field | DocType |
nice construction,good theoretical property,elliptic curve,linear complexity,e. shparlinski,naor-reingold sequence,elliptic curves,pseudo random function | Discrete mathematics,Supersingular elliptic curve,Combinatorics,Lenstra elliptic curve factorization,Division polynomials,Hessian form of an elliptic curve,Mathematics,Elliptic divisibility sequence,Counting points on elliptic curves,Schoof's algorithm,Edwards curve | Journal |
Volume | Issue | ISSN |
16 | 5 | 1071-5797 |
Citations | PageRank | References |
5 | 0.56 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcos Cruz | 1 | 5 | 0.56 |
| Domingo Gómez | 2 | 54 | 5.69 |
| D. Sadornil | 3 | 23 | 4.32 |