Local reduction and the algebraic cryptanalysis of the block cipher GOST
From MaRDI portal
Publication:2392058
DOI10.1007/S10998-012-6376-9zbMATH Open1289.94060OpenAlexW2051636922WikidataQ121620045 ScholiaQ121620045MaRDI QIDQ2392058FDOQ2392058
Authors: Pavol Zajac, Radoslav Čagala
Publication date: 6 August 2013
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-012-6376-9
Recommendations
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Title not available (Why is that?)
- On the complexity of \(k\)-SAT
- Solving multiple right hand sides linear equations
- On solving sparse algebraic equations over finite fields
- Sparse algebraic equations over finite fields
- Algebraic Cryptanalysis of the Data Encryption Standard
- Methods to solve algebraic equations in cryptanalysis
- Solving equation systems by agreeing and learning
- MRHS Equation Systems
- On the use of the lattice sieve in the 3D NFS
- Solving Trivium-based Boolean equations using the method of syllogisms
Cited In (2)
This page was built for publication: Local reduction and the algebraic cryptanalysis of the block cipher GOST
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392058)