Cited in
(70)- Finding shortest lattice vectors faster using quantum search
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm
- Hash-based signatures revisited: a dynamic FORS with adaptive chosen message security
- On removing rejection conditions in practical lattice-based signatures
- Quantum key search for ternary LWE
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- A constant-time sampling algorithm for binary Gaussian distribution over the integers
- Fully secure functional encryption for inner products, from standard assumptions
- From 5-pass \(\mathcal {MQ}\)-based identification to \(\mathcal {MQ}\)-based signatures
- Post-quantum cryptography: state of the art
- How to meet ternary LWE keys
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
- Policy-based signature scheme from lattices
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- One bit is all it takes: a devastating timing attack on BLISS's non-constant time sign flips
- How to find ternary LWE keys using locality sensitive hashing
- HMQV
- eBASH
- CFS
- BKZ
- Ziggurat
- ETRU
- MaTRU
- NTRU
- NTRUSign
- fpLLL
- strongSwan
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- ring-LWE
- Chipwhisperer
- liboqs
- SPHINCS
- rnorrexp
- Falcon
- fpylll
- PQM4
- Quirk
- FrodoKEM
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Analyzing the shuffling side-channel countermeasure for lattice-based signatures
- Isochronous Gaussian sampling: from inception to implementation
- Learning strikes again: the case of the DRS signature scheme
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Computational quantum key distribution (CQKD) on decentralized ledger and blockchain
- An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
- Modular lattice signatures, revisited
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- RLizard
- Short zero-knowledge proof of knowledge for lattice-based commitment
- Lattice signatures and bimodal Gaussians
- The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
- Naor-Yung paradigm with shared randomness and applications
- FACCT
- GALATICS
- G6K
- Duplication free public keys based on SIS-type problems
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- A signature scheme from the finite field isomorphism problem
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
- Asymptotically efficient lattice-based digital signatures
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
- FROST
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- MuSig2
- PQClean
- On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers
This page was built for software: BLISS
