Theoretical and empirical analysis of FALCON and SOLMAE using their Python implementation
From MaRDI portal
Publication:6547906
DOI10.1007/978-981-97-1238-0_13MaRDI QIDQ6547906
Publication date: 31 May 2024
lattice-based cryptographydiscrete Gaussian samplingPython implementationhash-and-sign ParadigmNTRU trapdoors
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- More efficient algorithms for the NTRU key generation using the field norm
- A Note on the Generation of Random Normal Deviates
- Trapdoors for hard lattices and new cryptographic constructions
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Information Security and Privacy
- Shorter hash-and-sign lattice-based signatures
This page was built for publication: Theoretical and empirical analysis of FALCON and SOLMAE using their Python implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547906)