An Analysis of Leading Lattice-Based Asymmetric Cryptographic Primitives

@article{Easttom2019AnAO,
  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)},
  year={2019},
  pages={0811-0818}
}
  • Chuck Easttom
  • Published 2019
  • Computer Science
  • 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… Expand
5 Citations

References

SHOWING 1-10 OF 54 REFERENCES
Quantum resistant public key cryptography: a survey
  • 87
A Decade of Lattice Cryptography
  • Chris Peikert
  • Mathematics, Computer Science
  • Found. Trends Theor. Comput. Sci.
  • 2016
  • 290
  • PDF
Lattice-based cryptography
  • 3
  • PDF
Efficient Identity-Based Encryption over NTRU Lattices
  • 139
  • PDF
Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
  • 133
  • PDF
NTRU: A Ring-Based Public Key Cryptosystem
  • 1,386
  • Highly Influential
  • PDF
The Relevance of Statistical Tests in Cryptography
  • E. Simion
  • Computer Science
  • IEEE Security & Privacy
  • 2015
  • 16
Cryptographic Hardness of Random Local Functions
  • B. Applebaum
  • Mathematics, Computer Science
  • computational complexity
  • 2015
  • 24
An introduction to mathematical cryptography
  • 239
...
1
2
3
4
5
...