Elliptic Curve Pseudorandom Sequence Generators - Gong, Berson, Stinson (ResearchIndex)

Elliptic Curve Pseudorandom Sequence Generators (1998) (Correct) (4 citations)
Guang Gong, Thomas A. Berson, Douglas R. StinsonSelected Areas in Cryptography
Search Context Related Track Related Site Documents

Download:
cacr.math.uwaterloo.ca/t...corr9853.ps
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  cacr.math.uwater...tech_reports98
Home:  G.Gong  T.Berson  [2]
  D.Stinson  HPSearch

Rate this article:

(best)
Comment on this article

Abstract: In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF(2 m ). We call these sequences elliptic curve pseudorandom sequences (EC-sequence). We will show their periods, distribution of zeros and ones, and linear spans. This research has uncovered a class of ECsequences, generated by super-singular curves, which has half period as a lower bound for their linear spans. In comparison to de Bruijn sequences with the same parameters, EC-sequences can be constructed algebraically and can be generated efficiently in software or hardware by means used for implementation of elliptic curve public-key cryptosystems.... (Correct Abstract)

Context of citations to this paper: More

...call S a binary elliptic curve pseudorandom sequence generated by E(F q ) of type I, an EC sequence for short. Remark 2 In the full paper [13], we discuss two other methods of constructing sequences from elliptic curves. Let A = a 1 ; a 2 ; Delta Delta Delta ; a l ) and B =...

...pseudo random function is uniformly distributed. Our results can also be used to prove that the elliptic curve analogues of the congruencial generator of pseudo random numbers (see [6, 7]) produce uniformly distributed sequences. Acknowledgment. The authors are grateful...

Cited by: More
On Exponential Sums and Group Generators for Elliptic.. - Kohel, Shparlinski (Correct)
On the Linear Complexity of the Naor-Reingold.. - Shparlinski, Silverman (2000) (Correct)
Elliptic Curve Pseudorandom Sequence Generators - Guang Gong Thomas (1998) (Correct)

Active bibliography (related documents): More All
2.3: Stream Ciphers - Robshaw (1995) (Correct)
1.1: New Designs for Signal Sets with Low Cross-correlation, Balance.. - Gong (Correct)
1.0: Enumeration and Criteria for Cyclically Shift-Distinct GMW.. - Guang Gong (1999) (Correct)

Users who viewed this document also viewed: More All
0.2: How to Break Gifford's Cipher - Cain, Sherman (1994) (Correct)
0.2: Transform Domain Analysis of DES - Gong, Golomb (Correct)
0.2: SOBER: A Stream Cipher based on Linear Feedback over GF(2 g ) - Rose (1999) (Correct)

Related documents from co-citation: More All
Doc 3: Linear congruential generators over elliptic curves - Hallgren - 1994
Doc 3: The Arithmetic of Elliptic Curves - Silverman - 1986
Doc 3: Elliptic curve public key cryptosystems - Menezes - 1993

BibTeX entry: (Correct)

G. Gong, T.A. Berson, and D.R. Stinson, Elliptic curve pseudorandom sequence generators, Technical Report, University of Waterloo, December 1998, http://www.cacr.math.uwaterloo.ca More

@inproceedings{ gong99elliptic,
    author = "Guang Gong and Thomas A. Berson and Douglas R. Stinson",
    title = "Elliptic Curve Pseudorandom Sequence Generators",
    booktitle = "Selected Areas in Cryptography",
    number = "Generators",
    pages = "34-48",
    year = "1999",
    url = "citeseer.nj.nec.com/article/gong98elliptic.html"
}

Citations (may not include all citations):
Doc 470 The Theory of Error-Correcting Codes - MacWilliams, Sloane - 1977
Doc 81 Elliptic Curve Public Key Cryptosystems - Menezes - 1993
Doc 75 Shift Register Sequences - Golomb - 1982
Doc 58 Encyclopedia of Mathematics and its Applications - Lidl, Niederreiter et al. - 1983
Doc 51 Shift-register synthesis and BCH decoding - Massey - 1969
Doc 44 A Course in Number Theory and Cryptography - Koblitz - 1988
Doc 39 Analysis and Design of Stream Ciphers - Rueppel - 1986
Doc 27 Spread Spectrum Communications Handbook - Simon, Omura et al. - 1994
Doc 17 An Improved algorithm for arithmetic on a family of elliptic.. - Solinas - 1997
Doc 15 An analysis of the structure and complexity of nonlinear bin.. - Key - 1976
Doc 12 Elliptic curve cryptosystems and their implementation - Menezes, Vanstone - 1993
Doc 11 Polynomial codes over certain finite fields - Reed, Solomon - 1960
Doc 9 GMW sequences - Scholtz, Welch - 1984
Doc 9 Bent-function sequences - Olsen, Scholtz et al. - 1982
Doc 9 On functions of linear shift register sequences - Herlestam - 1985
Doc 7 Cascaded GMW sequences - Klapper, Chan et al. - 1993
Doc 7 Clock-controlled shift registers: a review - Gollman, Chambers - 1989
Doc 6 Cross correlation properties of pseudo-random and related se.. - Sarwate, Pursley - 1980
Doc 6 Maximal recursive sequences with 3-valued recursive cross-co.. - Gold - 1968
Doc 5 The stop-and-go generator - Beth, Piper - 1985
Doc 4 the linear span of binary sequences from finite geometries - Chan, Games
Doc 4 Generation of binary sequences with controllable complexity - Groth - 1971
Doc 4 Products of linear recurring sequences with maximum complexi.. - Rueppel - 1987
Doc 3 A Fourier transform approach to the linear complexity of non.. - Massey, Serconek - 1994
Doc 3 The linear complexity of periodic sequences: a general theor.. - Massey, Serconek - 1996
Doc 3 Gammaary cascaded GMW sequences - Gong - 1996
Doc 3 New binary pseudorandom sequences of period 2 n \Gamma 1 wit.. - No, Golomb et al. - 1998
Doc 3 Gammaary PN sequences - Gong, class - 1997
Doc 3 Lecture Notes in Computer Science - Coppersmith, Krawczys et al. - 1994
Doc 3 the complexities of de Bruijn sequences - Chan, Games et al. - 1982
Doc 3 Highly nonlinear balanced Boolean functions with a good corr.. - Filiol, Fontaine - 1998
Doc 2 OptimumPN sequences for CDMA systems - Sarwate
Doc 2 the classification of balanced binary sequences of period 2 .. - Golomb - 1980
Doc 2 A generalized recursive construction for de Bruijn sequences - Games - 1983
Doc 2 Correlation-immunity of nonlinear combing functions for cryp.. - Siegenthaler - 1984
Doc 2 the linear complexity of combined shift register sequences - Brynielsson - 1985
Doc 2 Kononklijke Nederlands Akademi van Wetenchappen - de Bruijn, problem - 1946
Doc 2 Binary sequences with two-level autocorrelation - Gong, Golomb - 1999
Doc 2 Sequences of linear feedback shift registers with nonlinear .. - Kalouptsidis, Manolarakes - 1983
Doc 2 Products of linear recurring sequences - Zierler, Mills - 1973
Doc 2 An Analysis and Synthesis of Phases and Linear Complexity of.. - Gong - 1990
Doc 2 Linear spans of modified de Bruijn sequences - Mayhew, Golomb - 1990
Doc 2 Theory and applications of q \Gammaary interleaved sequences - Gong - 1995
Doc 2 A survey of full length nonlinear shift register cycle algor.. - Fredrickson - 1982
Doc 1 Construction of de Bruijn sequences of minimal complexity - Etzion, Lempel - 1984
Doc 1 Generation of binary sequences with controllable complexity .. - Siegenthaler, Forre - 1987
Doc 1 the complexity of functions of linear shift register sequenc.. - Herlestam
Doc 1 the linear complexity of functions of periodic GF - Golic - 1989
Doc 1 Efficient algorithms for ellitic curve cryptosystems - Guajardo, Paar - 1997
Doc 1 Multi-valued Cross-correlation Functions between Two Maximal.. - Niho - 1972
Doc 1 A new family of binary pseudo random sequences having optima.. - No, Kumar - 1989

Documents on the same site (http://cacr.math.uwaterloo.ca/techreports/1998/tech_reports98.html): More
An Application of Ramp Schemes to Broadcast Encryption - Stinson Department (Correct)
Better Random Walks For Pollard's Rho Method - Edlyn Teske (Correct)

Sample documents with summaries: Summarize this document
Autonomous Citation Matching - Steve Lawrence, C. Lee...
Building Documentation Generators - Arie van Deursen, Tobias ...
Family Structure from Periodic Solutions of an Improved Gap... - Marcus Hutter, Andreas...

ResearchIndex - researchindex.org - Terms of Service - Privacy Policy - Copyright © 1997-2001 NEC Research Institute