Solving multiple right hand sides linear equations

DOI10.1007/s10623-008-9180-zzbMath1179.94067OpenAlexW1965003774MaRDI QIDQ1009068

Håvard Raddum, I. A. Semaev

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9180-z

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear equations (linear algebraic aspects) (15A06)

Related Items

MaxMinMax problem and sparse equations over finite fields ⋮ Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath ⋮ An application of combinatorics in cryptography ⋮ Local reduction and the algebraic cryptanalysis of the block cipher GOST ⋮ A combinatorial problem related to sparse systems of equations ⋮ Algebraic Attacks Using Binary Decision Diagrams ⋮ Sparse Boolean equations and circuit lattices ⋮ Analysis of Multivariate Hash Functions ⋮ Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity ⋮ Fast correlation attack on stream cipher ABC v3 ⋮ Improved agreeing-gluing algorithm ⋮ MRHS solver based on linear algebra and exhaustive search ⋮ Algebraic Cryptanalysis of the Data Encryption Standard ⋮ MRHS Equation Systems ⋮ Improved Meet-in-the-Middle Attacks on Reduced-Round DES ⋮ Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach

Cites Work

• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• Fast Software Encryption
• Fast Software Encryption
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item