A new R-LWE based digital signature scheme
From MaRDI portal
Publication:6665869
Publication date: 17 January 2025
Published in: Gaṇita (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Tightly secure signatures from lossy identification schemes
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- On the concrete hardness of learning with errors
- A Decade of Lattice Cryptography
- An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation
- Lattice Signatures and Bimodal Gaussians
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Lattice Signatures without Trapdoors
- Lattice Cryptography for the Internet
- High-Speed Signatures from Standard Lattices
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Introduction to post-quantum cryptography
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- A Toolkit for Ring-LWE Cryptography
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Asymptotically Efficient Lattice-Based Digital Signatures
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A new R-LWE based digital signature scheme
