Results 21 to 30 of about 2,451 (171)
Area-Time Efficient Hardware Architecture for CRYSTALS-Kyber
Applied 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
Evaluation of Large Integer Multiplication Methods on Hardware [PDF]
, 2017 Multipliers requiring large bit lengths have a major impact on the performance of many applications, such as cryptography, digital signal processing (DSP) and image processing.
Hanley, Neil +2 more
core +1 more source
The Quantum Complexity of Set Membership [PDF]
, 2000 We study the quantum complexity of the static set membership problem: given a subset S (|S| \leq n) of a universe of size m (m \gg n), store it as a table of bits so that queries of the form `Is x \in S?' can be answered. The goal is to use a small table
Radhakrishnan, Jaikumar +2 more
core +5 more sources
The Entropy Conundrum: A Solution Proposal [PDF]
, 2014 In 2004, physicist Mark Newman, along with biologist Michael Lachmann and computer scientist Cristopher Moore, showed that if electromagnetic radiation is used as a transmission medium, the most information-efficient format for a given 1-D signal is ...
Fiorini, Rodolfo
core +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
Cryptography, 2023 The Number Theoretic Transform (NTT) has been widely used to speed up polynomial multiplication in lattice-based post-quantum algorithms. All NTT operands use modular arithmetic, especially modular multiplication, which significantly influences NTT ...
Trong-Hung Nguyen +2 more
doaj +1 more source
Post-quantum cryptographic hardware primitives [PDF]
, 2020 The development and implementation of post-quantum cryptosystems have become a pressing issue in the design of secure computing systems, as general quantum computers have become more feasible in the last two years.
Agrawal, Rashmi +3 more
core
Recovering missing slices of the discrete fourier transform using ghosts [PDF]
, 2012 The discrete Fourier transform (DFT) underpins the solution to many inverse problems commonly possessing missing or unmeasured frequency information. This incomplete coverage of the Fourier space always produces systematic artifacts called Ghosts.
Chandra, Shekhar S. +4 more
core +1 more source
Functional programming with bananas, lenses, envelopes and barbed wire [PDF]
, 1991 We develop a calculus for lazy functional programming based on recursion operators associated with data type definitions. For these operators we derive various algebraic laws that are useful in deriving and manipulating programs.
Fokkinga, Maarten +2 more
core +5 more sources
Cortex-M4 optimizations for {R,M} LWE schemes
Transactions on Cryptographic Hardware and Embedded Systems, 2020 This paper proposes various optimizations for lattice-based key encapsulation mechanisms (KEM) using the Number Theoretic Transform (NTT) on the popular ARM Cortex-M4 microcontroller.
Erdem Alkim +3 more
doaj +1 more source