Boolean functions derived from Fermat quotients

DOI10.1007/s12095-011-0043-5zbMath1235.06014OpenAlexW2040024264MaRDI QIDQ662181

Arne Winterhof, Hassan Y. Aly

Publication date: 21 February 2012

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-011-0043-5

zbMATH Keywords

nonlinearitycryptographyBoolean functionscombinatorial complexitysparsityaverage sensitivityLegendre symbolFermat quotients

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items

ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER–FERMAT QUOTIENTS ⋮ Trace representation and linear complexity of binary sequences derived from Fermat quotients ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Trace representation of pseudorandom binary sequences derived from Euler quotients ⋮ On the correlation measures of orders \(3\) and \(4\) of binary sequence of period \(p^2\) derived from Fermat quotients ⋮ Multiplicative character sums of Fermat quotients and pseudorandom sequences ⋮ Unnamed Item ⋮ A large family of Boolean functions ⋮ Polynomial quotients: Interpolation, value sets and Waring's problem ⋮ Additive character sums of polynomial quotients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplicative character sums of Fermat quotients and pseudorandom sequences
• Asymptotic nonlinearity of Boolean functions
• Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions
• BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES
• Pseudorandomness and Dynamics of Fermat Quotients
• CHARACTER SUMS WITH FERMAT QUOTIENTS
• Structure of Pseudorandom Numbers Derived from Fermat Quotients
• On the 𝑝-divisibility of Fermat quotients
• Coding and Cryptography

This page was built for publication: Boolean functions derived from Fermat quotients