Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness

zbMath1036.94001MaRDI QIDQ1854908

Igor E. Shparlinski

Publication date: 28 January 2003

Published in: Progress in Computer Science and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

cryptographypseudorandom numberssieve methodslinear complexityuniformity of distributionlower bounds on complexitylattice reduction algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (34)

A new lower bound on the family complexity of Legendre sequences ⋮ On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences ⋮ Pseudorandom sequences derived from automatic sequences ⋮ On the nonlinearity of the sequence of signs of Kloosterman sums ⋮ On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping ⋮ Carlitz rank and index of permutation polynomials ⋮ Attacking the linear congruential generator on elliptic curves via lattice techniques ⋮ On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences ⋮ Linear complexity profile and correlation measure of interleaved sequences ⋮ Fixed points of the subset sum pseudorandom number generators ⋮ On the number of factorizations of \(t\bmod N\) and the probability distribution of Diffie-Hellman secret keys for many users ⋮ Interpolation of the Double Discrete Logarithm ⋮ On some exponential sums with exponential and rational functions ⋮ Generalizations of complete mappings of finite fields and some applications ⋮ The Carlitz rank of permutations of finite fields: a survey ⋮ Security of polynomial transformations of the Diffie-Hellman key. ⋮ Multiplicative character sums of Fermat quotients and pseudorandom sequences ⋮ On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences ⋮ Boolean functions derived from Fermat quotients ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography ⋮ On the arithmetic autocorrelation of the Legendre sequence ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ Threshold circuit lower bounds on cryptographic functions ⋮ On the period of the Naor-Reingold sequence ⋮ On the singularity of generalised Vandermonde matrices over finite fields ⋮ Polynomial representations of the Lucas logarithm ⋮ Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves ⋮ On the bit security of the Diffie-Hellman key ⋮ On pseudo-random subsets of \({\mathbb{Z}}_n\) ⋮ Modified constructions of binary sequences using multiplicative inverse ⋮ On k-error linear complexity of some explicit nonlinear pseudorandom sequences ⋮ \(r\)-th order nonlinearity, correlation measure and least significant bit of the discrete logarithm ⋮ On the index of the Diffie-Hellman mapping

This page was built for publication: Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness