nach oben

Designs, Codes and Cryptography

Erschienen in:

01.10.2014

A family of elliptic curve pseudorandom binary sequences

verfasst von: Huaning Liu

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2014

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In this paper we give a new family of elliptic curve pseudorandom binary sequences, and study the well-distribution, correlation, linear complexity, collision and avalanche effect of the family of sequences, by using the estimate of exponential sums over elliptic curves.

Vorheriger Artikel New -ary sequences with low autocorrelation from interleaved technique

Nächster Artikel Erratum to: On the second weight of generalized Reed-Muller codes

Beelen P.H.T., Doumen J.M.: Pseudorandom sequences from elliptic curves. In: Proceedings of the \(6\)-th International Conference on Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, pp. 37–52 (2002).

Brandstätter N., Winterhof A.: Linear complexity profile of binary sequences with small correlation measure. Period. Math. Hung. 52, 1–8 (2006).

Cassaigne J., Mauduit C., Sárközy A.: On finite pseudorandom binary sequencs VII: the measures of pseudorandomness. Acta Arith. 103, 97–108 (2002).

Chen Z.: Elliptic curve analogue of Legendre sequences. Monatshefte für Mathematik 154, 1–10 (2008).

Chen Z., Wu C.: A construction of binary sequences from elliptic curves. In: International Conference on Information Technology and Computer Science, vol. 1, pp. 137–140 (2009).

Gong G., Berson T.A., Stinson D.R.: Elliptic curve pseudorandom sequence generators. Research Report CORR-98-53, University of Waterloo (1998).

Gong G., Lam C.C.Y.: Linear recursive sequences over elliptic curves. In: Proceedings of the International Conference on Sequences and their Applications, pp. 182–196 (2002).

Gyarmati K.: Elliptic curve analogues of a pseudorandom generator. Period. Math. Hung. 64, 119–130 (2012).

Gyarmati K., Mauduit C., Sárközy A.: Measures of pseudorandomness of families of binary lattices, II (A further construction), Publicationes Mathematicae Debrecen, to appear.

10.

Hallgren S.: Linear congruential generators over elliptic curves. Technical Report CS 94–143, Carnegie-Mellon University (1994).

11.

Hess F., Shparlinski I.: On the linear complexity and multidimensional distribution of congruential generators over elliptic curves. Des. Codes Cryptogr. 35, 111–117 (2005).

12.

Hu H., Hu L., Feng D.: On a class of pseudorandom sequences from elliptic curves over finite fields. IEEE Trans. Inf. Theory 53, 2598–2605 (2007).

13.

Kaliski B.S.: A pseudorandom bit generator based on elliptic logarithms. Lect. Notes Comput. Sci. 263, 84–103 (1986).

14.

Kohel D., Shparlinski I.: On exponential sums and group generators for elliptic curves over finite fields. Lect. Notes Comput. Sci. 1838, 395–404 (2000).

15.

Liu H.: A large family of pseudorandom binary lattices. In: Proceedings of the American Mathematical Society, vol. 137, pp. 793–803 (2009).

16.

Liu H., Zhan T., Wang X.: Large families of elliptic curve pseudorandom binary sequences. Acta Arith. 140, 135–144 (2009).

17.

Mahassni E.E., Shparlinski I.: On the uniformity of distribution of congruential generators over elliptic curves. In: Proceedings of the International Conference on Sequences and their Applications, pp. 257–264 (2002).

18.

Mauduit C., Sárközy A.: On finite pseudorandom binary sequencs I: measure of pseudorandomness, the Legendre symbol. Acta Arith. 82, 365–377 (1997).

19.

Mauduit C., Sárközy A.: Construction of pseudorandom binary lattices by using the multiplicative inverse. Monatshefte für Mathematik 153, 217–231 (2008).

20.

Menezes A.J., van Oorschot P.C., Vanstone S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996).

21.

Mérai L.: Remarks on pseudorandom binary sequences over elliptic curves. Fundam. Inform. 114, 301–308 (2012).

22.

Mérai L.: Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters. Publicationes Mathematicae Debrecen 80, 199–213 (2012).

23.

Rueppe, R.: Analysis and Design of Stream Cipher. Springer-Verlag, Berlin (1986).

24.

Tóth V.: Collision and avalanche effect in families of pseudorandom binary sequences. Period. Math. Hung. 55, 185–196 (2007).

25.

Xing C.P.: Constructions of sequences from algebraic curves over finite fields. In: Proceedings of the International Conference on Sequences and their Applications, pp. 88–100 (2002).

26.

Xing C.P., Kumar P.V., Ding C.S.: Low correlation, large linear span sequences from function fields. IEEE Trans. Inf. Theory 49, 1439–1446 (2003).

Titel: A family of elliptic curve pseudorandom binary sequences
verfasst von: Huaning Liu
Publikationsdatum: 01.10.2014
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 1/2014
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-013-9822-7

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 1/2014

Construction of codes from Arakelov geometry

Erratum to: On the second weight of generalized Reed-Muller codes

Cryptographic puzzles and DoS resilience, revisited

Admissible parameters of symmetric designs satisfying and symmetric designs with inner balance

Construction of relative difference sets and Hadamard groups

New infinite families of hyperovals on odd