On the Nonlinearity of Discrete Logarithm in $\mathbb F_{2^n}$

DOI10.1007/978-3-642-15874-2_29zbMath1257.94030OpenAlexW117953352MaRDI QIDQ3588606

Risto M. Hakala, Kaisa Nyberg

Publication date: 8 September 2010

Published in: Sequences and Their Applications – SETA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15874-2_29

zbMATH Keywords

nonlinearityBoolean functionsdiscrete logarithmS-boxessymmetric cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items (5)

The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function ⋮ A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions ⋮ A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers ⋮ Perfect nonlinear functions and cryptography ⋮ Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks

This page was built for publication: On the Nonlinearity of Discrete Logarithm in $\mathbb F_{2^n}$