Solving multiple right hand sides linear equations

DOI10.1007/S10623-008-9180-ZzbMATH Open1179.94067OpenAlexW1965003774MaRDI QIDQ1009068FDOQ1009068

Håvard Raddum, Igor 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) Cryptography (94A60) Linear equations (linear algebraic aspects) (15A06) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (17)

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

Recommendations

• Solving linear systems of equations 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Solving multiple right hand sides linear equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009068)