Verifying post-quantum signatures in 8 kB of RAM
From MaRDI portal
Publication:2118545
Recommendations
- Efficient post-quantum undeniable signature on 64-bit ARM
- The postprocessing of quantum digital signatures
- An efficient post-quantum one-time signature scheme
- Post-quantum cryptography: Code-based signatures
- A note on the post-quantum security of (ring) signatures
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
- LegRoast: efficient post-quantum signatures from the Legendre PRF
- Efficient arbitrated quantum signature and its proof of security
- Secure and efficient quantum designated verifier signature scheme
- Quantum public-key designated verifier signature
Cites work
- scientific article; zbMATH DE number 1617933 (Why is no real title available?)
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- scientific article; zbMATH DE number 1302783 (Why is no real title available?)
- scientific article; zbMATH DE number 1030996 (Why is no real title available?)
- ARMed SPHINCS
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Memory-efficient high-speed implementation of Kyber on Cortex-M4
- MicroEliece: McEliece for Embedded Devices
- SPHINCS: practical stateless hash-based signatures
- Trapdoors for hard lattices and new cryptographic constructions
- Unbalanced Oil and Vinegar Signature Schemes
This page was built for publication: Verifying post-quantum signatures in 8 kB of RAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118545)