Key-recovery attacks on \(\mathsf{ASASA}\)
From MaRDI portal
Publication:2413617
DOI10.1007/s00145-017-9272-xzbMath1400.94166OpenAlexW2768348791MaRDI QIDQ2413617
Brice Minaud, Pierre Karpman, Pierre-Alain Fouque, Patrick Derbez
Publication date: 14 September 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-017-9272-x
Related Items
Improved key-recovery attacks on reduced-round WEM-8 ⋮ Implicit white-box implementations: white-boxing ARX ciphers ⋮ A white-box speck implementation using self-equivalence encodings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving LPN using BKW and variants, Implementation and analysis
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- High order derivatives and decomposition of multivariate polynomials
- Public-Key Cryptography from New Multivariate Quadratic Assumptions
- Polynomial Decompositions in Polynomial Time
- Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
- Decomposition of generic multivariate polynomials
- On the Influence of the Algebraic Degree of $F^{-1}$ on the Algebraic Degree of $G \circ F$
- Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
- An Improved LPN Algorithm
- Practical Cryptanalysis of SFLASH
- Cube Attacks on Tweakable Black Box Polynomials
- A family of trapdoor ciphers
- Algorithmic regularity for polynomials and applications
- Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions
- Advances in Cryptology - CRYPTO 2003
- Cryptanalysis of HFE with Internal Perturbation
- Cryptanalysis of 2R− Schemes
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- Public Key Cryptography – PKC 2004