A closer look at \textsc{Falcon}

DOI10.1007/978-3-032-25327-9_1MaRDI QIDQ7304103zbMATH OpenFDO

Authors Pierre-Alain Fouque, Phillip Gajland, Hubert de Groote, Jonas Janneck, Eike Kiltz

Publication date 24 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25327-9_1

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON
• \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
• A direct key recovery attack on SIDH
• A Pseudorandom Generator from any One-way Function
• A toolkit for ring-LWE cryptography
• An efficient key recovery attack on SIDH
• Breaking rainbow takes a weekend on a laptop
• Breaking SIDH in polynomial time
• Compact lattice gadget and its applications to hash-and-sign signatures
• Digital Signatures Do Not Guarantee Exclusive Ownership
• Efficient identity-based encryption over NTRU lattices
• Fast Fourier orthogonalization
• Finding short integer solutions when the modulus is small
• Fixing and mechanizing the security proof of Fiat-Shamir with aborts and Dilithium
• Generalized Compact Knapsacks Are Collision Resistant
• scientific article; zbMATH DE number 3173999 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1962147 (Why is no real title available?)
• scientific article; zbMATH DE number 1445397 (Why is no real title available?)
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Lattice signatures without trapdoors
• LWE with side information: attacks and concrete security estimation
• Making NTRU as secure as worst-case problems over ideal lattices
• More efficient algorithms for the NTRU key generation using the field norm
• New bounds in some transference theorems in the geometry of numbers
• On the concrete hardness of learning with errors
• On the ring-LWE and polynomial-LWE problems
• Random oracles in a quantum world
• Raptor: a practical lattice-based (linkable) ring signature
• Ring signatures for deniable AKEM: Gandalf's fellowship
• Sharper bounds in lattice-based cryptography using the Rényi divergence
• Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
• The exact security of digital signatures -- how to sign with RSA and Rabin
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Tighter security for efficient lattice cryptography via the Rényi divergence of optimized orders
• Trapdoors for hard lattices and new cryptographic constructions
• Worst-case to average-case reductions based on Gaussian measures
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(1)

• Revisiting the concrete security of \textsc{Falcon}-type signatures

This page was built for publication: A closer look at \textsc{Falcon}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304103)