GeMSS
From MaRDI portal
Cited in
(30)- Polynomial selection for computing Gröbner bases
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Security comparisons and performance analyses of post-quantum signature algorithms
- New practical multivariate signatures from a nonlinear modifier
- On the effect of projection on rank attacks in multivariate cryptography
- Efficient key recovery for all HFE signature variants
- New complexity estimation on the rainbow-band-separation attack
- Polynomial selection of <i>F</i><sub>4</sub> for solving the MQ problem
- On the equivalence of two post-quantum cryptographic families
- A multivariate cryptosystem inspired by random linear codes
- Cryptanalysis of the extension field cancellation cryptosystem
- Solving the problem of blockwise isomorphism of polynomials with circulant matrices
- TCPDUMP
- MQ Challenge
- VBF
- liboqs
- WalnutDSA
- Falcon
- LEDAkem
- M4GB
- Efficient key generation for Rainbow
- BIKE
- EFLASH
- MutantXL
- ZHFE
- SQISign: compact post-quantum signatures from quaternions and isogenies
- A novel classical and quantum cryptographic scheme for data encryption
- LEDAcrypt
- Sidon Cryptosystem
- All in the \(C^*\) family
This page was built for software: GeMSS
