Pages that link to "Item:Q1854908"

The following pages link to Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness (Q1854908):

Displaying 30 items.

• On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences (Q398935) (← links)
• Multiplicative character sums of Fermat quotients and pseudorandom sequences (Q452834) (← links)
• On the arithmetic autocorrelation of the Legendre sequence (Q514542) (← links)
• Boolean functions derived from Fermat quotients (Q662181) (← links)
• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences (Q851764) (← links)
• Linear complexity profile and correlation measure of interleaved sequences (Q892510) (← links)
• Finite binary sequences constructed by explicit inversive methods (Q938755) (← links)
• On the period of the Naor-Reingold sequence (Q975477) (← links)
• On pseudo-random subsets of \({\mathbb{Z}}_n\) (Q1024221) (← links)
• Modified constructions of binary sequences using multiplicative inverse (Q1032814) (← links)
• Security of polynomial transformations of the Diffie-Hellman key. (Q1418189) (← links)
• Carlitz rank and index of permutation polynomials (Q1679707) (← links)
• Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions (Q1755993) (← links)
• On the singularity of generalised Vandermonde matrices over finite fields (Q1779326) (← links)
• On some exponential sums with exponential and rational functions (Q1951362) (← links)
• On the index of the Diffie-Hellman mapping (Q2081557) (← links)
• A new lower bound on the family complexity of Legendre sequences (Q2121576) (← links)
• Pseudorandom sequences derived from automatic sequences (Q2154881) (← links)
• \(r\)-th order nonlinearity, correlation measure and least significant bit of the discrete logarithm (Q2325298) (← links)
• Generalizations of complete mappings of finite fields and some applications (Q2437319) (← links)
• The Carlitz rank of permutations of finite fields: a survey (Q2437320) (← links)
• On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences (Q2442861) (← links)
• Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography (Q2470209) (← links)
• Threshold circuit lower bounds on cryptographic functions (Q2485284) (← links)
• Polynomial representations of the Lucas logarithm (Q2500606) (← links)
• On the bit security of the Diffie-Hellman key (Q2502165) (← links)
• Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)
• On k-error linear complexity of some explicit nonlinear pseudorandom sequences (Q3403211) (← links)
• Fixed points of the subset sum pseudorandom number generators (Q6101274) (← links)
• On the number of factorizations of \(t\bmod N\) and the probability distribution of Diffie-Hellman secret keys for many users (Q6167305) (← links)