Results 71 to 80 of about 120,587 (184)

Cryptomite: A versatile and user-friendly library of randomness extractors [PDF]

open access: yesQuantum
We present $\texttt{Cryptomite}$, a Python library of randomness extractor implementations. The library offers a range of two-source, seeded and deterministic randomness extractors, together with parameter calculation modules, making it easy to use and ...
Cameron Foreman   +3 more
doaj   +1 more source

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.
openaire   +2 more sources

Comparative Deep Learning-Based Side-Channel Analysis of an FPGA-Based CRYSTALS-Kyber NTT Accelerator

open access: yesCryptography
Deep learning-based side-channel analysis is one of the most effective techniques for extracting and classifying sensitive information from a target device.
Munkhbaatar Chinbat   +4 more
doaj   +1 more source

Configurable Arithmetic Core Architecture for RNS-CKKS Homomorphic Encryption

open access: yesIEEE Access
Fully Homomorphic Encryption (FHE) provides privacy-preserving applications due to its ability to perform arithmetic computations such as addition and multiplication on encrypted data without decrypting them first.
Chulwoo Lee   +3 more
doaj   +1 more source

Fast number-theoretic transforms for digital filtering

open access: yesElectronics Letters, 1976
A special number-theoretic transform that can be computed, using a high-radix fast Fourier transform, is defined on primes of the form (2n ? 1) 2n +1. Methods for finding these primes and the primitive dth roots of unity in a field modulo such primes are also included.
K.Y. Liu, I.S. Reed, T.K. Truong
openaire   +1 more source

Strings, Loops, Knots and Gauge Fields

open access: yes, 1993
The loop representation of quantum gravity has many formal resemblances to a background-free string theory. In fact, its origins lie in attempts to treat the string theory of hadrons as an approximation to QCD, in which the strings represent flux tubes ...
Baez, John C.
core   +1 more source

DEVELOPMENT OF A METHOD TO REDUCE COMPUTATIONAL COSTS IN COMMUNICATION SYSTEMS WITH UFMC THROUGH THE USE OF NUMBER-THEORETIC TRANSFORMATIONS

open access: yesСовременная наука и инновации, 2022
The search for new ways to improve the parameters of mobile radio communication systems OFDM led to the intensification of the development of mathematical models with the properties of finite algebraic structures. Proposed in this paper the transition to
M. I. Kalmykov   +4 more
doaj  

Highly-Efficient Hardware Architecture for ML-KEM PQC Standard

open access: yesIEEE Open Journal of Circuits and Systems
The advent of quantum computers, with their immense computational potential, poses significant threats to traditional cryptographic systems. In response, NIST announced the quantum-resistant Module Lattice-based Key Encapsulation Mechanism (ML-KEM ...
Haesung Jung   +2 more
doaj   +1 more source

Security in Post-Quantum Era: A Comprehensive Survey on Lattice-Based Algorithms

open access: yesIEEE Access
Lattice-based post-quantum cryptography (PQC) has attracted significant attention as a promising solution to the security challenges posed by quantum computing.
Hien Nguyen   +3 more
doaj   +1 more source

High-Efficiency Multi-Standard Polynomial Multiplication Accelerator on RISC-V SoC for Post-Quantum Cryptography

open access: yesIEEE Access
Number Theoretic Transform (NTT) enables speeding up polynomial multiplications, thereby accelerating the implementation of lattice-based post-quantum cryptography (PQC) algorithms.
Duc-Thuan Dam   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy