Elliptic Curve Pseudorandom Sequence Generators

  • Authors:
  • Guang Gong;Thomas A. Berson;Douglas R. Stinson

  • Affiliations:
  • -;-;-

  • Venue:
  • SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF(2m). We call these sequences elliptic curve pseudorandom sequences (EC-sequence). We determine their periods, distribution of zeros and ones, and linear spans for a class of EC-sequences generated from supersingular curves. We exhibit a class of EC-sequences which has half period as a lower bound for their linear spans. EC-sequences can be constructed algebraically and can be generated efficiently in software or hardware by the same methods that are used for implementation of elliptic curve public-key cryptosystems.