Results 1 to 10 of about 165,252 (290)
Neon NTT: Faster Dilithium, Kyber, and Saber on Cortex-A72 and Apple M1
Transactions on Cryptographic Hardware and Embedded Systems, 2021 We present new speed records on the Armv8-A architecture for the latticebased schemes Dilithium, Kyber, and Saber. The core novelty in this paper is the combination of Montgomery multiplication and Barrett reduction resulting in “Barrett multiplication ...
Hanno Becker +4 more
doaj +1 more source
Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography
Transactions on Cryptographic Hardware and Embedded Systems, 2023 Lattice-based cryptography has laid the foundation of various modern-day cryptosystems that cater to several applications, including post-quantum cryptography. For structured lattice-based schemes, polynomial arithmetic is a fundamental part. In several
Aikata Aikata +4 more
doaj +1 more source
Polynomial Multiplication in NTRU Prime
Transactions on Cryptographic Hardware and Embedded Systems, 2020 This paper proposes two different methods to perform NTT-based polynomial multiplication in polynomial rings that do not naturally support such a multiplication. We demonstrate these methods on the NTRU Prime key-encapsulation mechanism (KEM) proposed by
Erdem Alkim +10 more
doaj +3 more sources
NTT Multiplication for NTT-unfriendly Rings
Transactions on Cryptographic Hardware and Embedded Systems, 2021 In this paper, we show how multiplication for polynomial rings used in the NIST PQC finalists Saber and NTRU can be efficiently implemented using the Number-theoretic transform (NTT).
Chi-Ming Marvin Chung +5 more
doaj +1 more source
IEEE Access, 2022 Falcon is one of the promising digital-signature algorithms in NIST’s ongoing Post-Quantum Cryptography (PQC) standardization finalist. Computational efficiency regarding software and hardware is also the main criteria for PQC standardization.
Youngbeom Kim +2 more
doaj +1 more source
Polynomial multiplication on embedded vector architectures
Transactions on Cryptographic Hardware and Embedded Systems, 2021 High-degree, low-precision polynomial arithmetic is a fundamental computational primitive underlying structured lattice based cryptography. Its algorithmic properties and suitability for implementation on different compute platforms is an active area of ...
Hanno Becker +4 more
doaj +1 more source
IEEE Access, 2022 Polynomial multiplication is one of the heaviest operations for a lattice-based public key algorithm in Post-Quantum Cryptography (PQC). Many studies have been done to accelerate polynomial multiplication with newly developed hardware accelerators or ...
Jong-Yeon Park +4 more
doaj +1 more source
FourierPIM: High-throughput in-memory Fast Fourier Transform and polynomial multiplication
Memories - Materials, Devices, Circuits and Systems, 2023 The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity from the naive O(
Orian Leitersdorf +4 more
doaj +1 more source
Configurable Mixed-Radix Number Theoretic Transform Architecture for Lattice-Based Cryptography
IEEE Access, 2022 Lattice-based cryptography continues to dominate in the second-round finalists of the National Institute of Standards and Technology post-quantum cryptography standardization process. Computational efficiency is primarily considered to evaluate promising
Phap Duong-Ngoc, Hanho Lee
doaj +1 more source
Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach [PDF]
, 2013 Tavenas has recently proved that any n^{O(1)}-variate and degree n polynomial in VP can be computed by a depth-4 circuit of size 2^{O(\sqrt{n}\log n)}. So to prove VP not equal to VNP, it is sufficient to show that an explicit polynomial in VNP of degree
Chillara, Suryajith +1 more
core +2 more sources