Projective interpolation of polynomial vectors and improved key recovery attack on SFLASH
From MaRDI portal
Publication:404920
DOI10.1007/s10623-013-9819-2zbMath1308.94063OpenAlexW2043983322MaRDI QIDQ404920
Publication date: 4 September 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9819-2
symbolic computationnumerical computationmultivariate public key signatureprojective interpolationSFLASH
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
The orthogonal Lie algebra of operators: ideals and derivations ⋮ Non-linear preservers of the product of \(C\)-skew symmetry ⋮ Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The Magma algebra system. I: The user language
- On the complexity of computing determinants
- Multivariate public key cryptosystems
- Practical Key-Recovery for All Possible Parameters of SFLASH
- Practical Cryptanalysis of SFLASH
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Cryptanalysis of SFLASH with Slightly Modified Parameters
This page was built for publication: Projective interpolation of polynomial vectors and improved key recovery attack on SFLASH
