Probabilistic Versus Deterministic Algebraic Cryptanalysis—A Performance Comparison

DOI10.1109/TIT.2009.2030489MaRDI QIDQ4974072zbMATH OpenOpenAlexFDO

Authors E. Pasalic

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2009.2030489

Mathematics Subject Classification ID

Cryptography (94A60)

Cited in

(3)

• Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
• Accurate estimates of the data complexity and success probability for various cryptanalyses
• Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC

This page was built for publication: Probabilistic Versus Deterministic Algebraic Cryptanalysis—A Performance Comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974072)