On the linear complexity profile of some sequences derived from elliptic curves
From MaRDI portal
Publication:306337
DOI10.1007/s10623-015-0140-0zbMath1383.94010arXiv1509.06909OpenAlexW2263720025MaRDI QIDQ306337
Publication date: 31 August 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.06909
elliptic curveslinear complexitypseudorandom sequencesEdwards coordinateselliptic curve generatorelliptic curve power generator
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Elliptic curves (14H52) Random number generation in numerical analysis (65C10)
Related Items
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences, Linear complexity of some sequences derived from hyperelliptic curves of genus 2, On the elliptic curve endomorphism generator, Secure simultaneous bit extraction from Koblitz curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the joint linear complexity profile of explicit inversive multisequences
- A complete set of addition laws for incomplete Edwards curves
- On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
- On the linear complexity profile of the power generator
- Applied Number Theory
- Recent Results on Recursive Nonlinear Pseudorandom Number Generators
- Certain Exponential Sums and Random Walks on Elliptic Curves
- Character sums with exponential functions
- Faster Addition and Doubling on Elliptic Curves
- A normal form for elliptic curves
- Progress in Cryptology - INDOCRYPT 2003
- On the linear complexity of the power generator