Results 31 to 40 of about 120,587 (184)

Area-Time Efficient Hardware Architecture for CRYSTALS-Kyber

open access: yesApplied Sciences, 2022
This paper presents a novel area-time efficient hardware architecture of the lattice-based CRYSTALS-Kyber, which has entered the third round of the post-quantum cryptography standardization competition hosted by the National Institute of Standards and ...
Tuy Tan Nguyen   +3 more
doaj   +1 more source

Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial [PDF]

open access: yes, 2010
We present an algorithm running in time O(n ln n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutations.
Bassino, Frédérique   +3 more
core   +2 more sources

HARQ Buffer Management: An Information-Theoretic View

open access: yes, 2015
A key practical constraint on the design of Hybrid automatic repeat request (HARQ) schemes is the size of the on-chip buffer that is available at the receiver to store previously received packets. In fact, in modern wireless standards such as LTE and LTE-
Kang, Joonhyuk   +4 more
core   +1 more source

High-Performance Number Theoretic Transform on GPU Through radix2-CT and 4-Step Algorithms

open access: yesIEEE Access
The number theoretic transform (NTT) provides a practical and efficient technique to perform multiplication of very large degree polynomials typically found in fully homomorphic encryption (FHE), lattice-based cryptography, and non-interactive succinct ...
Alisah Ozcan   +2 more
doaj   +1 more source

Homomorphic Encryption on GPU

open access: yesIEEE Access, 2023
Homomorphic encryption (HE) is a cryptosystem that allows the secure processing of encrypted data. One of the most popular HE schemes is the Brakerski-Fan-Vercauteren (BFV), which supports somewhat (SWHE) and fully homomorphic encryption (FHE).
Ali Sah Ozcan   +3 more
doaj   +1 more source

Arithmetic Spacetime Geometry from String Theory

open access: yes, 2005
An arithmetic framework to string compactification is described. The approach is exemplified by formulating a strategy that allows to construct geometric compactifications from exactly solvable theories at $c=3$.
Conway J. H.   +14 more
core   +1 more source

Fast Digital Convolutions using Bit-Shifts [PDF]

open access: yes, 2010
An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two.
Chandra, Shekhar S.
core  

High Throughput Arithmetic Computing Unit for BFV Homomorphic Encryption

open access: yesIEEE Open Journal of Circuits and Systems
Homomorphic Encryption (HE) enables secure computations on encrypted data, which is crucial for cloud and edge computing. The BFV scheme, widely used for integer arithmetic, faces performance bottlenecks in polynomial multiplication, especially in tensor
Rella Mareta   +2 more
doaj   +1 more source

Optimal Discrete Uniform Generation from Coin Flips, and Applications [PDF]

open access: yes, 2013
This article introduces an algorithm to draw random discrete uniform variables within a given range of size n from a source of random bits. The algorithm aims to be simple to implement and optimal both with regards to the amount of random bits consumed ...
Lumbroso, Jérémie
core  

The theory of manipulations of pure state asymmetry: basic tools and equivalence classes of states under symmetric operations

open access: yes, 2013
If a system undergoes symmetric dynamics, then the final state of the system can only break the symmetry in ways in which it was broken by the initial state, and its measure of asymmetry can be no greater than that of the initial state.
Barut A O   +14 more
core   +1 more source

Home - About - Disclaimer - Privacy