Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
From MaRDI portal
Publication:510448
DOI10.1007/s10623-016-0256-xzbMath1366.94545OpenAlexW2507035040WikidataQ121338009 ScholiaQ121338009MaRDI QIDQ510448
Publication date: 10 February 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-016-0256-x
Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving multiple right hand sides linear equations
- On solving sparse algebraic equations over finite fields
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
- A new method to solve MRHS equation systems and its connection to group factorization
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Solving Compressed Right Hand Side Equation Systems with Linear Absorption
- The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
- The Multiplicative Complexity of Boolean Functions on Four and Five Variables
- Ciphers for MPC and FHE
- Decoding One Out of Many
- Analysis of Trivium Using Compressed Right Hand Side Equations
- Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles
- PRESENT: An Ultra-Lightweight Block Cipher
- Solving Equation Systems by Agreeing and Learning
- MRHS Equation Systems
This page was built for publication: Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
