IEEE Transactions on Very Large Scale Integration (VLSI) Systems · 2023 · 16 citations · 31 references
ComputingComputer EngineeringComputer ScienceCryptographyEdge ComputingInternet Of ThingsCryptographic AlgorithmsCryptographic ArchitecturePost-quantum CryptographyQuantum CryptographyArithmetic CircuitsCryptographic Accelerator DesignCryptographic AcceleratorsPost-quantum Cryptographic ProtocolsPost-quantum Cryptography ImplementationPost-quantum Cryptography StandardizationRing Learning With Errors
Along with the National Institute of Standards and Technology (NIST) post-quantum cryptography (PQC) standardization process, lightweight PQC-related research, and development have also gained substantial attention from the research community. Ring-binary-learning-with-errors (RBLWE), a ring variant of binary-LWE (BLWE), has been used to build a promising lightweight PQC scheme for emerging Internet-of-Things (IoT) and edge computing applications, namely the RBLWE-based encryption scheme (RBLWE-ENC). The parameter settings of RBLWE-ENC, however, are not in favor of deploying typical fast algorithms like number theoretic transform (NTT). Following this direction, in this work, we propose a Karatsuba initiated novel accelerator (KINA) for efficient implementation of RBLWE-ENC. Overall, we have made several coherent interdependent stages of efforts to carry out the proposed work: 1) we have innovatively used the Karatsuba algorithm (KA) to derive the major arithmetic operation of RBLWE-ENC into a new form for high-performance operation; 2) we have then effectively mapped the proposed algorithm into an efficient hardware accelerator with the help of a number of optimization techniques; and 3) we have also provided detailed complexity analysis and implementation comparison to demonstrate the superior performance of the proposed KINA, e.g., the proposed design with <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$u=2$</tex-math> </inline-formula> involves 64.71% higher throughput and 15.37% less area-delay product (ADP) than the state-of-the-art design for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$n=512$</tex-math> </inline-formula> (Virtex-7). The proposed KINA offers flexible processing speed and is suitable for high-performance applications like IoT servers. This work is expected to be useful for lightweight PQC development.
31
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 2002 · 8.5K citations
Computing, Computer Science, Physics +12
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · Journal of the ACM · 2009 · 2.2K citations
Daniel J. Bernstein, Tanja Lange · Nature · 2017 · 1.1K citations · Full text
Multiplication of Multidigit Numbers on Automata
Anatolij A. Karatsuba, Yu. Ofman · Soviet physics. Doklady · 1963 · 794 citations