Fast Software Encryption
From MaRDI portal
Publication:5473585
DOI10.1007/b137506zbMath1140.94330OpenAlexW4214882369WikidataQ28000487 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
Related Items
Compact representation of polynomials for algorithms for computing Gröbner and involutive bases, Algebraic Attacks Using Binary Decision Diagrams, 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, Towards closing the security gap of Tweak-aNd-Tweak (TNT), Computation of involutive and Gröbner bases using the tableau representation of polynomials, A New Structural-Differential Property of 5-Round AES, Penalized semidefinite programming for quadratically-constrained quadratic optimization, MRHS Equation Systems, Group theoretic properties of Rijndael-like ciphers, Solving multiple right hand sides linear equations, Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach, Wide Trail Design Strategy for Binary MixColumns, Practical Algebraic Attacks on the Hitag2 Stream Cipher, Polybori: A framework for Gröbner-basis computations with Boolean polynomials, Specific S-Box Criteria in Algebraic Attacks on Block Ciphers with Several Known Plaintexts
