GeMSS

swMATH39669MaRDI QIDQ55369FDOQ55369

Author name not available (Why is that?)

Cited In (16)

• A multivariate cryptosystem inspired by random linear codes
• All in the \(C^*\) family
• 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
• Solving the problem of blockwise isomorphism of polynomials with circulant matrices
• A novel classical and quantum cryptographic scheme for data encryption
• Polynomial selection of <i>F</i>₄ for solving the MQ problem
• SQISign: compact post-quantum signatures from quaternions and isogenies
• New complexity estimation on the rainbow-band-separation attack
• Polynomial selection for computing Gröbner bases
• Cryptanalysis of the extension field cancellation cryptosystem
• On the equivalence of two post-quantum cryptographic families
• Efficient Key Generation for Rainbow

This page was built for software: GeMSS