nach oben

Cryptography and Communications

Erschienen in:

20.08.2021

Linear complexity of some sequences derived from hyperelliptic curves of genus 2

verfasst von: Vishnupriya Anupindi, László Mérai

Erschienen in: Cryptography and Communications | Ausgabe 1/2022

Einloggen

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

search-config

KI-gestützte Suche

Aus

Abstract

For a given hyperelliptic curve C over a finite field with Jacobian J_C, we consider the hyperelliptic analogue of the congruential generator defined by W_n = W_n− 1 + D for n ≥ 1 and D, W₀ ∈ J_C. We show that curves of genus 2 produce sequences with large linear complexity.

Vorheriger Artikel Permutations without linear structures inducing bent functions outside the completed Maiorana-McFarland class

Nächster Artikel A new family of polyphase sequences with low correlation

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Nur mit Berechtigung zugänglich

Beelen, P. H. T., Doumen, J. M.: Pseudorandom sequences from elliptic curves, Finite fields with applications to coding theory, cryptography and related areas (Oaxaca, 2001), pp 37–52. Springer, Berlin (2002)CrossRef

Cantor, D.G.: Computing in the Jacobian of a hyperelliptic curve. Math. Comp. 48(177), 95–101 (1987)MathSciNetCrossRef

Chen, Z.: Elliptic curve analogue of Legendre sequences. Monatsh Math. 154(1), 1–10 (2008)MathSciNetCrossRef

Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F. (eds.): Discrete Mathematics and its Applications. Chapman & Hall/CRC, Boca Raton (2006)

El Mahassni, E., Shparlinski, I.: On the uniformity of distribution of congruential generators over elliptic curves, Discrete Math. Theor. Comput. Sci. (Lond.), pp. 257–264. Springer, London (2002)

Farashahi, R.R.: Extractors for Jacobian of hyperelliptic curves of genus 2 in odd characteristic, Cryptography and coding, Lecture Notes in Comput. Sci., vol. 4887, pp. 313–335. Springer, Berlin (2007)

Farashahi, R.R., Pellikaan, R.: The quadratic extension extractor for (hyper)elliptic curves in odd characteristic, Arithmetic of finite fields, Lecture Notes in Comput. Sci., vol. 4547, pp. 219–236. Springer, Berlin (2007)

Galbraith, S.D.: Mathematics of Public Key Cryptography. Cambridge University Press, Cambridge (2012)CrossRef

Gong, G., Berson, T.A., Stinson, D.R.: Elliptic curve pseudorandom sequence generators, Selected areas in cryptography (Kingston, ON, 1999), Lecture Notes in Comput. Sci., vol. 1758, pp. 34–48. Springer, Berlin (2000)

10.

Gong, G., Lam, C. C. Y.: Linear recursive sequences over elliptic curves, Discrete Math. Theor. Comput. Sci. (Lond.), pp. 182–196. Springer, London (2002)

11.

Grant, D.: Formal groups in genus two. J. Reine Angew. Math. 411, 96–121 (1990)MathSciNetMATH

12.

Hallgren, S.: Linear congruential generators over elliptic curves, Tech. report, Dept. Of Comp. Sci. Cornegie Mellon Univ. (1994)

13.

Hartshorne, R.: Algebraic geometry. Springer, New York. Graduate texts in mathematics No. 52 (1977)

14.

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

15.

Hindry, M., Silverman, J.H.: Diophantine Geometry, Graduate Texts in Mathematics, vol. 201. Springer, New York. An introduction (2000)

16.

Koblitz, N.: Algebraic aspects of cryptography, Algorithms and Computation in Mathematics, vol. 3, Springer, Berlin. With an Appendix by Alfred J. Menezes, Yi-Hong Wu and Robert J. Zuccherato (1998)

17.

Kohel, D.R., Shparlinski, I.E.: On exponential sums and group generators for elliptic curves over finite fields, Algorithmic number theory (Leiden, 2000), Lecture Notes in Comput. Sci., vol. 1838, pp. 395–404. Springer, Berlin (2000)

18.

Lange, T.: Formulae for arithmetic on genus 2 hyperelliptic curves. Appl. Algebra Engrg. Comm. Comput. 15(5), 295–328 (2005)MathSciNetCrossRef

19.

Lange, T., Shparlinski, I.: Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves. Appl. Algebra Engrg. Comm. Comput. 5, 329–337 (2005)MathSciNetCrossRef

20.

Lange, T., Shparlinski, I.E.: Certain exponential sums and random walks on elliptic curves. Canad. J. Math. 2, 338–350 (2005)MathSciNetCrossRef

21.

Meidl, W., Winterhof, A.: Linear Complexity of Sequences and Multisequences, Handbook of Finite Fields. CRC Press, Boca Raton (2013)

22.

Mérai, L.: Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters. Publ. Math. Debrecen 80(1-2), 199–213 (2012)MathSciNetCrossRef

23.

Mérai, L.: Remarks on pseudorandom binary sequences over elliptic curves. Fund. Inform. 3-4, 301–308 (2012)MathSciNetMATH

24.

Mérai, L., Winterhof, A.: On the linear complexity profile of some sequences derived from elliptic curves. Des. Codes Cryptogr. 81(2), 259–267 (2016)MathSciNetCrossRef

25.

Mumford, D.: Modern Birkhäuser Classics. Birkhäuser Boston, Inc., Boston (2007). Jacobian theta functions and differential equations, With the collaboration of C. Musili, M. Nori, E. Previato, M. Stillman and H. Umemura, Reprint of the 1984 original

26.

Niederreiter, H.: Linear complexity and related complexity measures for sequences, Progress in cryptology—INDOCRYPT, 2003, Lecture Notes in Comput. Sci., vol. 2904, pp. 1–17. Springer, Berlin (2003)

27.

Schmid, J.: On the affine Bezout inequality. Manuscripta Math. 88 (2), 225–232 (1995)MathSciNetCrossRef

28.

Shparlinski, I.E.: Pseudorandom number generators from elliptic curves, Recent trends in cryptography, Contemp, Math., vol. 477, pp. 121–141. Amer. Math. Soc., Providence (2009)

29.

Stichtenoth, H.: Algebraic function felds and codes, 2nd edn., vol. 254. Graduate Texts in Mathematics. Springer, Berlin (2009)

30.

Topuzoğlu, A., Winterhof, A.: Pseudorandom sequences, Topics in geometry, coding theory and cryptography, Algebr. Appl., vol. 6, p. 135–166. Springer, Dordrecht (2007)

31.

Winterhof, A.: Linear complexity and related complexity measures, Selected topics in information and coding theory. Ser. Coding Theory Cryptol., vol. 7, pp. 3–40. World Sci. Publ., Hackensack (2010)

Titel: Linear complexity of some sequences derived from hyperelliptic curves of genus 2
verfasst von: Vishnupriya Anupindi
László Mérai
Publikationsdatum: 20.08.2021
Verlag: Springer US
Erschienen in: Cryptography and Communications / Ausgabe 1/2022
Print ISSN: 1936-2447
Elektronische ISSN: 1936-2455
DOI: https://doi.org/10.1007/s12095-021-00521-y

Springer Professional

Abstract

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

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 1/2022

Permutations without linear structures inducing bent functions outside the completed Maiorana-McFarland class

New constant dimension subspace codes from block inserting constructions

On equivalence between two known families of APN polynomial functions and APN power functions

Correction to: New constructions of entanglement-assisted quantum codes

Construction of LCD and new quantum codes from cyclic codes over a finite non-chain ring

New Galois Hulls of GRS Codes and Application to EAQECCs