Secure simultaneous bit extraction from Koblitz curves

DOI10.1007/S10623-018-0484-3zbMath1403.94057OpenAlexW2797024006MaRDI QIDQ1755988

Guang Gong, Andrey Sidorenko, Francesco Sica, Berry Schoenmakers, Xin-Xin Fan

Publication date: 11 January 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-018-0484-3

zbMATH Keywords

elliptic curvescryptographypseudo-random number generator

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the linear complexity profile of some sequences derived from elliptic curves
• Extractors for binary elliptic curves
• A family of elliptic curve pseudorandom binary sequences
• On Randomness Extraction in Elliptic Curves
• Lower bounds on the lengths of double-base representations
• Security Analysis of the Strong Diffie-Hellman Problem
• Double-Base Number System for Multi-scalar Multiplications
• Large families of elliptic curve pseudorandom binary sequences
• A Simple Unpredictable Pseudo-Random Number Generator
• Elliptic Curve Cryptosystems
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• Identity-Based Encryption from the Weil Pairing
• On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• The double-base number system and its application to elliptic curve cryptography
• Extending Scalar Multiplication Using Double Bases
• Efficient Pseudorandom Generators Based on the DDH Assumption
• Cryptography and Coding

This page was built for publication: Secure simultaneous bit extraction from Koblitz curves