Results 301 to 310 of about 211,169 (330)

Post-Quantum Lattice-Based Cryptography Implementations

ACM Computing Surveys, 2019
The advent of quantum computing threatens to break many classical cryptographic schemes, leading to innovations in public key cryptography that focus on post-quantum cryptography primitives and protocols resistant to quantum computing threats.
Hamid Nejatollahi, N. Dutt, S. Ray, Francesco Regazzoni, Indranil Banerjee, Rosario Cammarota   +5 more
semanticscholar   +1 more source

Zero-Value Filtering for Accelerating Non-Profiled Side-Channel Attack on Incomplete NTT-Based Implementations of Lattice-Based Cryptography

IEEE Transactions on Information Forensics and Security
Lattice-based cryptographic schemes such as Crystals-Kyber and Dilithium are post-quantum algorithms selected to be standardized by NIST as they are considered to be secure against quantum computing attacks.
Tolun Tosun, E. Savaş
semanticscholar   +1 more source

Efficient key revocation in WSN with lattice-based cryptography

Journal of Discrete Mathematical Sciences and Cryptography
Strong security is crucial as Wireless Sensor Network (WSN) become more common. Dynamic Lattice-Based Key Revocation (DLBKR) is a novel method for improving key revocation in WSN.
I. Khan, Neha Gupta, Sheela N. Hundekari, Ashish Bansal, Rupali A. Mahajan   +4 more
semanticscholar   +1 more source

Lattice-Based Cryptography and NTRU

2021
With the publication of Peter Shor’s seminal paper that factoring and discrete log computations would be entirely feasible on a quantum computer, and with advances in the building of quantum computers, there has been a focus on what is referred to as “post-quantum cryptography”.
openaire   +2 more sources

Performance Characterization of Lattice-Based Cryptography Workloads

2020 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), 2020
In the domain of lattice cryptography, an emerging field of post-quantum secure cryptography, very few accelerator designs exist that both sufficiently accelerate a particular lattice cryptosystem and provide enough flexibility to accommodate a variety of cryptographic schemes.
Ronald G. Dreslinski, Deepika Natarajan
openaire   +2 more sources

RNS Approach in Lattice-Based Cryptography

2017
Lattice-based cryptography (LBC) is a main branch of modern cryptography. Growing up and evolving mainly since 1996 [1], it is known to be a viable post-quantum alternative to all cryptosystems based on the factorization and discrete logarithm problems [30], such as the widely used Diffie-Hellman [8] key-exchange protocol and RSA [26].
Bajard, Jean-Claude, Eynard, Julien
openaire   +3 more sources

Proof of a Shuffle for Lattice-Based Cryptography

2017
In this paper we present the first proof of a shuffle for lattice-based cryptography which can be used to build a universally verifiable mix-net capable of mixing votes encrypted with a post-quantum algorithm, thus achieving long-term privacy. Universal verifiability is achieved by means of the publication of a non-interactive zero knowledge proof of a
Costa, Nuria, Martínez, Ramiro, Morillo, Paz   +2 more
openaire   +2 more sources

Lattice-based cryptography: From reconfigurable hardware to ASIC

2016 International Symposium on Integrated Circuits (ISIC), 2016
As progress in technology is predicted to make quantum computers available in the next few decades, it is imperative to design public-key cryptosystems capable of resisting attacks that are perceived to be possible using these new platforms. Lattice-based cryptography is one of the most promising quantum-safe candidates being considered to replace ...
Oder, Tobias, Güneysu, Tim, Valencia, Felipe, Khalid, Ayesha, O'Neill, Maire, Regazzoni, Francesco   +5 more
openaire   +3 more sources

Improvement of Lattice-Based Cryptography Using CRT [PDF]

, 2010
In this paper, we first critically analyze two existing lattice-based cryptosystems, namely GGH and Micciancio, and identify their drawbacks. Then, we introduce a method for improving the implementation of GGH using the Chinese Remainder Theorem (CRT). Furthermore, we also propose another cryptosystem optimized for CRT, drawing on the strengths of both
Willy Susilo, Thomas Plantard, Michael Rose   +2 more
openaire   +1 more source

Generalization of Lattice-Based Cryptography on Hypercomplex Algebras

2021
We propose a fast, probabilistic, multi-dimensional quantum-resistant public key cryptosystem “STRU cryptosystem” relying on sedenion algebra, which is power associative and flexible, but non-associative and non-alternative. STRU cryptosystem encrypts 16 data vectors at each encryption round.
Sonika Singh, Sahadeo Padhye, Ankal Pal
openaire   +2 more sources