| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4583098 | Finite Fields and Their Applications | 2010 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
