An Analysis of Leading Lattice-Based Asymmetric Cryptographic Primitives

  title={An Analysis of Leading Lattice-Based Asymmetric Cryptographic Primitives},
  author={Chuck Easttom},
  journal={2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)},
  • Chuck Easttom
  • Published 2019
  • Computer Science, Mathematics
  • 2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)
Cryptographic primitives have been constructed on a wide range of mathematical basis. For asymmetric cryptography, those bases are problems in number theory. Lattice based mathematical problems provide a basis for cryptographic algorithms. Lattice-based cryptographic algorithms are believed to be resistant to quantum computing attacks. This makes research concerning these algorithms important. What is lacking in the current literature is a comparative study of existing cryptanalysis data for… 

Figures and Tables from this paper

NewHope: A Mobile Implementation of a Post-Quantum Cryptographic Key Encapsulation Mechanism
Assessing the platform flexibility and resource requirements of NewHope KEMs on an Android mobile device found NewHope post-quantum cryptography (PQC) key encapsulation mechanism (KEM) is the only Round 2 candidate to simultaneously achieve small key values through the use of a security problem with sufficient confidence its security, while mitigating any known vulnerabilities.
Computational quantum key distribution (CQKD) on decentralized ledger and blockchain
The end result will be the security of one time pad encryption and quantum encryption, an intrinsic crypto agility linked to the dynamic allocation and functionalization of nodes, a growing security proportional to the growth of the number of network nodes used to encrypt and transmit the information.
Towards A Deeper NTRU Analysis: A Multi Modal Analysis
This current study uses a unique approach to provide well-founded conclusions regarding NTRU, where the team of researchers divided into -sub-teams' work was brought together into a single cohesive statistical analysis.
MuReQua Chain: Multiscale Relativistic Quantum Blockchain
A new approach to fix the validation of a block and the assignment of a new block in a blockchain infrastructure by using a novel negotiation procedure based on an extended probability environment that appears to solve some of the most relevant questions in the Blockchain context.
Quantum Computing and Cryptography


Quantum resistant public key cryptography: a survey
A survey of some of the public key cryptographic algorithms that have been developed that, while not currently in widespread use, are believed to be resistant to quantum computing based attacks and discuss some the issues that protocol designers may need to consider if there is a need to deploy these algorithms at some point in the future.
A Decade of Lattice Cryptography
  • Chris Peikert
  • Computer Science, Mathematics
    Found. Trends Theor. Comput. Sci.
  • 2016
This work surveys most of the major developments in lattice cryptography over the past ten years, focusing on the foundational short integer solution SIS and learning with errors LWE problems and their more efficient ring-based variants, their provable hardness assuming the worst-case intractability of standard lattice problems, and their many cryptographic applications.
Lattice-based cryptography
This paper focuses on the recent advancement in lattice-based public key cryptosystems and key exchange mechanisms based on the learning with errors (LWE) problem and its ring variant Ring-LWE.
Post-quantum cryptography: lattice-based cryptography and analysis of NTRU public-key cryptosystem
The scrutiny done since its presentation until now reveal that NTRU is secure and is a good successor for replacing the current constructions currently in use, which makes it considerably faster than RSA and ECC.
Efficient Identity-Based Encryption over NTRU Lattices
This work presents the first lattice-based IBE scheme with practical parameters and obtains digital signature schemes which are shorter than the previously most-compact ones of Ducas, Durmus, Lepoint, and Lyubashevsky from Crypto 2013.
Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
This work presents an efficient and scalable micro-code engine for Ring-LWE encryption that combines polynomial multiplication based on the Number Theoretic Transform NTT,Polynomial addition, subtraction, and Gaussian sampling in a single unit.
NTRU: A Ring-Based Public Key Cryptosystem
NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory to create a new public key cryptosystem.
The Relevance of Statistical Tests in Cryptography
  • Emil Simion
  • Computer Science, Mathematics
    IEEE Security & Privacy
  • 2015
The evaluation of a cryptographic primitive (such as a block/stream cipher algorithm or pseudorandom bit generator) involves statistical testing meant to identify nonrandom behavior that can be
Cryptographic Hardness of Random Local Functions
  • B. Applebaum
  • Computer Science, Mathematics
    computational complexity
  • 2015
This work will survey known attacks and hardness results, discuss different flavors of hardness (one-wayness, pseudorandomness, collision resistance, public-key encryption, and mention applications to other problems in cryptography and computational complexity, with the hope to develop a systematic study of the cryptographic hardness of local functions.
An introduction to mathematical cryptography
The second edition of An Introduction to Mathematical Cryptography includes a significant revision of the material on digital signatures, including an earlier introduction to RSA, Elgamal, and DSA signatures, and new material on lattice-based signatures and rejection sampling.