Fast Software Encryption

DOI10.1007/b137506zbMath1140.94330WikidataQ28000487 ScholiaQ28000487MaRDI QIDQ5473585

Sean Murphy, Matthew J. B. Robshaw, Carlos Cid

Publication date: 22 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137506

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

MRHS Equation Systems, Specific S-Box Criteria in Algebraic Attacks on Block Ciphers with Several Known Plaintexts, A New Structural-Differential Property of 5-Round AES, Optimizing the depth of quantum implementations of linear layers, Obtaining and solving systems of equations in key variables only for the small variants of AES, Group theoretic properties of Rijndael-like ciphers, Solving multiple right hand sides linear equations, Polybori: A framework for Gröbner-basis computations with Boolean polynomials, Penalized semidefinite programming for quadratically-constrained quadratic optimization, Computation of involutive and Gröbner bases using the tableau representation of polynomials, Compact representation of polynomials for algorithms for computing Gröbner and involutive bases, Towards closing the security gap of Tweak-aNd-Tweak (TNT), Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach, Wide Trail Design Strategy for Binary MixColumns, Algebraic Attacks Using Binary Decision Diagrams, Practical Algebraic Attacks on the Hitag2 Stream Cipher