Linear complexity of sequences on Koblitz curves of genus 2
From MaRDI portal
Publication:2103481
DOI10.2478/udt-2022-0010OpenAlexW4311795685MaRDI QIDQ2103481
Publication date: 13 December 2022
Published in: Uniform Distribution Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.13523
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Elliptic curves over global fields (11G05) Curves over finite and local fields (11G20) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast multiplication on elliptic curves over small fields of characteristic two
- Elliptic curve cryptosystems over small fields of odd characteristic
- Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves
- Koblitz curve cryptosystems
- Efficient arithmetic on Koblitz curves
- Linear complexity of some sequences derived from hyperelliptic curves of genus 2
- On the number of points of algebraic sets over finite fields
- Mathematics of Public Key Cryptography
- Formal groups in genus two.
- Algebraic Function Fields and Codes
- Certain Exponential Sums and Random Walks on Elliptic Curves
- On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve
- Progress in Cryptology - INDOCRYPT 2003
- Distribution of some sequences of points on elliptic curves
- Tata lectures on theta. II: Jacobian theta functions and differential equations. With the collaboration of C. Musili, M. Nori, E. Previato, M. Stillman, and H. Umemura
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
This page was built for publication: Linear complexity of sequences on Koblitz curves of genus 2
