Results 1 to 10 of about 9,783,086 (278)

Elliptic Curve Cryptography for Wireless Sensor Networks Using the Number Theoretic Transform [PDF]

open access: yesSensors, 2020
We implement elliptic curve cryptography on the MSP430 which is a commonly used microcontroller in wireless sensor network nodes. We use the number theoretic transform to perform finite field multiplication and squaring as required in elliptic curve ...
Utku Gulen, Selcuk Baktir
doaj   +5 more sources

Fast Number Theoretic Transform for Ring-LWE on 8-bit AVR Embedded Processor [PDF]

open access: yesSensors, 2020
In this paper, we optimized Number Theoretic Transform (NTT) and random sampling operations on low-end 8-bit AVR microcontrollers. We focused on the optimized modular multiplication with secure countermeasure (i.e., constant timing), which ensures high ...
Hwajeong Seo   +6 more
doaj   +2 more sources

Pipelined and conflict-free number theoretic transform accelerator for CRYSTALS-Kyber on FPGA [PDF]

open access: yesPLoS ONE
Post-quantum cryptographic (PQC) algorithms are essential due to the threat posed by quantum computers to the security of currently deployed cryptosystems.
Ayesha Waris   +2 more
doaj   +3 more sources

Area-time efficient pipelined number theoretic transform for CRYSTALS-Kyber. [PDF]

open access: yesPLoS ONE
CRYSTALS-Kyber has been standardized by the National Institute of Standards and Technology (NIST) as a quantum-resistant algorithm in the post-quantum cryptography (PQC) competition. The bottleneck in performance of Kyber is the polynomial multiplication
Ayesha Waris   +2 more
doaj   +2 more sources

The Number Theoretic Hilbert Transform [PDF]

open access: yesCircuits, Systems, and Signal Processing, 2014
This paper presents a general expression for a number-theoretic Hilbert transform (NHT). The transformations preserve the circulant nature of the discrete Hilbert transform (DHT) matrix together with alternating values in each row being zero and non-zero. Specific examples for 4-point, 6-point, and 8-point NHT are provided.
Subhash Kak
exaly   +3 more sources

RM-NTT: An RRAM-Based Compute-in-Memory Number Theoretic Transform Accelerator

open access: yesIEEE Journal on Exploratory Solid-State Computational Devices and Circuits, 2022
As more cloud computing resources are used for machine learning training and inference processes, privacy-preserving techniques that protect data from revealing at the cloud platforms attract increasing interest. Homomorphic encryption (HE) is one of the
Yongmo Park   +3 more
doaj   +2 more sources

Faster arithmetic for number-theoretic transforms

open access: yesJournal of Symbolic Computation, 2014
We show how to improve the efficiency of the computation of fast Fourier transforms over F_p where p is a word-sized prime. Our main technique is optimisation of the basic arithmetic, in effect decreasing the total number of reductions modulo p, by making use of a redundant representation for integers modulo p.
David Harvey
exaly   +4 more sources

Implementation of number-theoretic transforms

open access: yesElectronics Letters, 1976
We propose various methods for the implementation of number-theoretic transforms to a prime or prime-power modulus. Such transforms may be performed in a processor or by special hardware. We also give, without proof, the condition for the existence of transforms in an arbitrary ring.
exaly   +2 more sources

Identifying generators for number theoretic transforms

open access: yesElectronics Letters, 1996
The author presents results that can be used to obtain all the possible generators for a given number theoretic transform (NTT). A generalisation of the well known Euler theorem is derived which can be used to determine all the generators of a given NTT once the generators over the underlying finite field are identified.
H K Garg
exaly   +2 more sources

Configurable Mixed-Radix Number Theoretic Transform Architecture for Lattice-Based Cryptography

open access: yesIEEE 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

Home - About - Disclaimer - Privacy