Theoretical and empirical analysis of FALCON and SOLMAE using their Python implementation

DOI10.1007/978-981-97-1238-0_13MaRDI QIDQ6547906zbMATH OpenFDO

Authors Kwangjo Kim

Publication date 31 May 2024

Full work available at URL https://doi.org/10.1007/978-981-97-1238-0_13

zbMATH Keywords

lattice-based cryptographydiscrete Gaussian samplingPython implementationhash-and-sign ParadigmNTRU trapdoors

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer security (68M25)

Cites work

• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1088230 (Why is no real title available?)
• A Note on the Generation of Random Normal Deviates
• Information Security and Privacy
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
• More efficient algorithms for the NTRU key generation using the field norm
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Shorter hash-and-sign lattice-based signatures
• Trapdoors for hard lattices and new cryptographic constructions
• \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}

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)