A comparison of unified multiplier designs for the \textsc{Falcon} post-quantum digital signature. A case study of baseline, Tiling, Comba and Karatsuba approaches for FPGA and ASIC

DOI10.1007/978-3-032-15541-2_5MaRDI QIDQ7319794zbMATH OpenFDO

Authors Rahul Magesh, Modini Ayyagari, Sharath Pendyala, Aydin Aysu

Publication date 26 August 2026

Full work available at URL https://doi.org/10.1007/978-3-032-15541-2_5

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Evaluation of Large Integer Multiplication Methods on Hardware
• Fast Fourier orthogonalization
• Fast multiplication of large numbers
• Fully homomorphic encryption using ideal lattices
• scientific article; zbMATH DE number 3948147 (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?)
• Modular Multiplication Without Trial Division
• New directions in cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

This page was built for publication: A comparison of unified multiplier designs for the \textsc{Falcon} post-quantum digital signature. A case study of baseline, Tiling, Comba and Karatsuba approaches for FPGA and ASIC

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