Influence of addition modulo \(2^n\) on algebraic attacks

DOI10.1007/s12095-015-0136-7zbMath1338.94076OpenAlexW833016788MaRDI QIDQ269574

Roman Oliynykov, Oleksandr Kazymyrov, Håvard Raddum

Publication date: 19 April 2016

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

Full work available at URL: https://doi.org/10.1007/s12095-015-0136-7

zbMATH Keywords

block cipheraddition modulo \(2^n\)algebraic attackbinary decision diagram

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath ⋮ Type-preserving matrices and security of block ciphers

Cites Work

• Unnamed Item
• The block cipher companion.
• Solving Compressed Right Hand Side Equation Systems with Linear Absorption
• Algebraic Attacks Using Binary Decision Diagrams
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations

This page was built for publication: Influence of addition modulo \(2^n\) on algebraic attacks