The following pages link to Fast Software Encryption (Q5473585):
Displaying 15 items.
- Obtaining and solving systems of equations in key variables only for the small variants of AES (Q626949) (← links)
- Group theoretic properties of Rijndael-like ciphers (Q1003702) (← links)
- Solving multiple right hand sides linear equations (Q1009068) (← links)
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials (Q1030264) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Computation of involutive and Gröbner bases using the tableau representation of polynomials (Q2217202) (← links)
- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases (Q2629402) (← links)
- Towards closing the security gap of Tweak-aNd-Tweak (TNT) (Q2692356) (← links)
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (Q2818203) (← links)
- Wide Trail Design Strategy for Binary MixColumns (Q2822689) (← links)
- Algebraic Attacks Using Binary Decision Diagrams (Q2947100) (← links)
- Practical Algebraic Attacks on the Hitag2 Stream Cipher (Q3399209) (← links)
- MRHS Equation Systems (Q5452259) (← links)
- Specific S-Box Criteria in Algebraic Attacks on Block Ciphers with Several Known Plaintexts (Q5504554) (← links)
- A New Structural-Differential Property of 5-Round AES (Q5738978) (← links)
