Access the full text.
Sign up today, get DeepDyve free for 14 days.
Morris Dworkin (2015)
SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions
R. Avanzi (2017)
CRYSTALS-KYBERTechnical Report. NIST.
Adeline Langlois, D. Stehlé (2014)
Worst-case to average-case reductions for module latticesDesigns, Codes and Cryptography, 75
Y. Shao, S. Xi, V. Srinivasan, Gu-Yeon Wei, D. Brooks (2016)
Co-designing accelerators and SoC interfaces using gem5-Aladdin2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)
L. Ducas (2017)
CRYSTALS-DilithiumTechnical Report. National Institute of Standards and Technology.
A. Langlois (2012)
Worst-Case to Average-Case Reductions for Module LatticesCryptology ePrint Archive.
M. Seo (2017)
EMBLEM and RTechnical Report. National Institute of Standards and Technology.
M. Doomun, K. Soyjaudah, D. Bundhoo (2007)
Energy consumption and computational analysis of rijndael-AES2007 3rd IEEE/IFIP International Conference in Central Asia on Internet
O. Regev (2005)
On lattices, learning with errors, random linear codes, and cryptography
Sied Ansarmohammadi, Saeed Shahinfar, Hamid Nejatollahi (2015)
Fast and area efficient implementation for chaotic image encryption algorithms2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS)
E. Alkım, L. Ducas, T. Pöppelmann, P. Schwabe (2016)
NewHope without reconciliationIACR Cryptol. ePrint Arch., 2016
E. Alkim (2016)
NewHope Without ReconciliationCryptology ePrint Archive
E. Targhi, Dominique Unruh (2016)
Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
M. R. Albrecht (2018)
Implementing RLWE-based Schemes Using an RSA Co-ProcessorCryptology ePrint Archive, Report 2018/425. Retrieved from https://eprint.iacr.org/2018/425.
Utsav Banerjee, T. Ukyab, A. Chandrakasan (2019)
Sapphire: A Configurable Crypto-Processor for Post-Quantum Lattice-based ProtocolsArXiv, abs/1910.07557
P. Shor (1995)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Rev., 41
(2017)
EMBLEM and R.EMBLEM
(2017)
CRYSTALS-Dilithium. Technical Report
Tianyu Bai, Spencer Davis, Juanjuan Li, Hai Jiang (2014)
Analysis and acceleration of NTRU lattice-based cryptographic system15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)
E. Fujisaki, T. Okamoto (1999)
Secure Integration of Asymmetric and Symmetric Encryption SchemesJournal of Cryptology, 26
R. Feynman (1999)
Simulating physics with computersInternational Journal of Theoretical Physics, 21
P. Kuo (2017)
High Performance Post-Quantum Key Exchange on FPGAsCryptology ePrint Archive, Report 2017/690. Retrieved from https://eprint.iacr.org/2017/690.
J. Cooley, J. Tukey (1965)
An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 19
W. Gentleman, G. Sande (1966)
Fast Fourier Transforms: for fun and profit
Martin Albrecht, Christian Hanser, Andrea Höller, T. Pöppelmann, Fernando Virdia, Andreas Wallner (2018)
Implementing RLWE-based Schemes Using an RSA Co-ProcessorIACR Trans. Cryptogr. Hardw. Embed. Syst., 2019
Hamid Nejatollahi, Sina Shahhosseini, Rosario Cammarota, N. Dutt (2020)
Exploring Energy Efficient Quantum-resistant Signal Processing Using Array ProcessorsICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
K. Basu (2019)
NIST Post-Quantum Cryptography- A Hardware Evaluation StudyCryptology ePrint Archive
Hamid Nejatollahi, N. Dutt, S. Ray, Francesco Regazzoni, Indranil Banerjee, Rosario Cammarota (2019)
Post-Quantum Lattice-Based Cryptography ImplementationsACM Computing Surveys (CSUR), 51
Jevgenijus Toldinas, V. Stuikys, Robertas Damaševičius, Giedrius Ziberkas, M. Banionis (2011)
Energy Efficiency Comparison with Cipher Strength of AES and Rijndael Cryptographic Algorithms in Mobile DevicesElektronika Ir Elektrotechnika, 108
Vadim Lyubashevsky, Chris Peikert, O. Regev (2010)
On Ideal Lattices and Learning with Errors over RingsIACR Cryptol. ePrint Arch., 2012
E. Board, Kurt Binder, A. Dinner (2014)
Quantum information and computation for chemistry.
(2017)
A Modular and Systematic Approach to Key Establishment and Public-Key Encryption Based on LWE and Its Variants
T. Poppelmann (2017)
NewHopeTechnical Report. NIST.
N. Binkert, Bradford Beckmann, Gabriel Black, S. Reinhardt, A. Saidi, Arkaprava Basu, Joel Hestness, Derek Hower, T. Krishna, S. Sardashti, Rathijit Sen, Korey Sewell, Muhammad Altaf, Nilay Vaish, M. Hill, D. Wood (2011)
The gem5 simulatorSIGARCH Comput. Archit. News, 39
Vadim Lyubashevsky (2009)
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
(2011)
The Keccak reference
M. Naehrig (2017)
FrodoKEMTechnical Report. National Institute of Standards and Technology.
K. Basu, Deepraj Soni, M. Nabeel, R. Karri (2019)
NIST Post-Quantum Cryptography- A Hardware Evaluation StudyIACR Cryptol. ePrint Arch., 2019
Hamid Nejatollahi, N. Dutt, Rosario Cammarota (2017)
Trends, challenges and needs for lattice-based cryptography implementations: special sessionProceedings of the Twelfth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis Companion
H. Nejatollahi (2018)
Domain-specific Accelerators for Ideal Lattice-based Public Key ProtocolsCryptology ePrint Archive
Po-Chun Kuo, Yu-Wei Chen, Yuan-Che Hsu, Chen-Mou Cheng, Wen-Ding Li, Bo-Yin Yang (2021)
High Performance Post-Quantum Key Exchange on FPGAsJ. Inf. Sci. Eng., 38
Hamid Nejatollahi, N. Dutt, Indranil Banerjee, Rosario Cammarota (2018)
Domain-specific Accelerators for Ideal Lattice-based Public Key ProtocolsIACR Cryptol. ePrint Arch., 2018
NTTCorporation (2008)
PSEC-KEM SpecificationPSEC-KEM Specification.
A. Wander, N. Gura, H. Eberle, Vipul Gupta, S. Shantz (2005)
Energy analysis of public-key cryptography for wireless sensor networksThird IEEE International Conference on Pervasive Computing and Communications
Hamid Nejatollahi, Rosario Cammarota, N. Dutt (2019)
Flexible NTT Accelerators for RLWE Lattice-Based Cryptography2019 IEEE 37th International Conference on Computer Design (ICCD)
H. Nejatollahi (2019)
Post-quantum lattice-based cryptography implementations: A surveyACM Comput. Surv. (2019).
T. Güneysu, Tobias Oder (2017)
Towards lightweight Identity-Based Encryption for the post-quantum-secure Internet of Things2017 18th International Symposium on Quality Electronic Design (ISQED)
The advent of the quantum computer makes current public-key infrastructure insecure. Cryptography community is addressing this problem by designing, efficiently implementing, and evaluating novel public-key algorithms capable of withstanding quantum computational power. Governmental agencies, such as NIST, are promoting standardization of quantum-resistant algorithms that is expected to run for 7 years. Several modern applications must maintain permanent data secrecy; therefore, they ultimately require the use of quantum-resistant algorithms. Because algorithms are still under scrutiny for eventual standardization, the deployment of the hardware implementation of quantum-resistant algorithms is still in early stages. In this article, we propose a methodology to design programmable hardware accelerators for lattice-based algorithms, and we use the proposed methodology to implement flexible and energy efficient post-quantum cache-based accelerators for NewHope, Kyber, Dilithium, Key Consensus from Lattice (KCL), and R.EMBLEM submissions to the NIST standardization contest. To the best of our knowledge, we propose the first efficient domain-specific, programmable cache-based accelerators for lattice-based algorithms. We design a single accelerator for a common kernel among various schemes with different kernel sizes, i.e., loop count, and data types. This is in contrast to the traditional approach of designing one special purpose accelerators for each scheme. We validate our methodology by integrating our accelerators into an HLS-based SoC infrastructure based on the X86 processor and evaluate overall performance. Our experiments demonstrate the suitability of the approach and allow us to collect insightful information about the performance bottlenecks and the energy efficiency of the explored algorithms. Our results provide guidelines for hardware designers, highlighting the optimization points to address for achieving the highest energy minimization and performance increase. At the same time, our proposed design allows us to specify and execute new variants of lattice-based schemes with superior energy efficiency compared to the main application processor without changing the hardware acceleration platform. For example, we manage to reduce the energy consumption up to 2.1× and energy-delay product (EDP) up to 5.2× and improve the speedup up to 2.5×.
ACM Transactions on Embedded Computing Systems (TECS) – Association for Computing Machinery
Published: Mar 11, 2020
Keywords: Public key cryptography
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.