On the distribution of the Diffie-Hellman pairs
From MaRDI portal
Publication:1609391
DOI10.1006/ffta.2000.0321zbMath1003.11059OpenAlexW2050905931MaRDI QIDQ1609391
Publication date: 15 August 2002
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/ffta.2000.0321
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items
Prime divisors of sparse integers, On exponential sums over multiplicative subgroups of medium size, Cancellation in a short exponential sum, On the complexity of the discrete logarithm and Diffie-Hellman problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequences, discrepancies and applications
- Number theoretic methods in cryptography. Complexity lower bounds
- Synthesizers and their application to the parallel construction of pseudo-random functions
- On the Naor-Reingold pseudo-random function from elliptic curves
- Efficient cryptographic schemes provably as secure as subset sum
- On the uniformity of distribution of the RSA pairs
- On the distribution of the power generator
- Number-theoretic constructions of efficient pseudo-random functions
- A Simple Unpredictable Pseudo-Random Number Generator
- Quasi-Monte Carlo methods and pseudo-random numbers
- On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples
- New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum
- ON THE DISTRIBUTION OF DIGITS IN PERIODIC FRACTIONS
- On the statistical properties of Diffie-Hellman distributions
- On the uniformity of distribution of the Naor-Reingold pseudo-random function
- On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.
