Results 21 to 30 of about 1,416 (297)
A Mathematical Perspective on Post-Quantum Cryptography
In 2016, the National Institute of Standards and Technology (NIST) announced an open competition with the goal of finding and standardizing suitable algorithms for quantum-resistant cryptography.
Maximilian Richter +3 more
doaj +1 more source
Post-quantum identity-based authenticated multiple key agreement protocol
Authenticated multiple key agreement (AMKA) protocols provide participants with multiple session keys after one round of authentication. Many schemes use Diffie-Hellman or authenticated key agreement schemes that rely on hard integer factorizations that ...
Yang Yang +3 more
doaj +1 more source
Verified NTT Multiplications for NISTPQC KEM Lattice Finalists: Kyber, SABER, and NTRU
Postquantum cryptography requires a different set of arithmetic routines from traditional public-key cryptography such as elliptic curves. In particular, in each of the lattice-based NISTPQC Key Establishment finalists, every state-ofthe-art optimized ...
Vincent Hwang +6 more
doaj +3 more sources
An Efficient Algorithm for the Shortest Vector Problem
Lattice is widely used in cryptography since it has potential for defending quantum attacks. One of the significant problems in such cryptography is the shortest vector problem (SVP). This problem is to find the non-zero shortest vector in lattice.
Yu-Lun Chuang, Chun-I Fan, Yi-Fan Tseng
doaj +1 more source
Lattice-Based Cryptography [PDF]
We describe some of the recent progress on lattice-based cryptography, starting from the seminal work of Ajtai, and ending with some recent constructions of very efficient cryptographic schemes.
openaire +4 more sources
Sapphire: A Configurable Crypto-Processor for Post-Quantum Lattice-based Protocols
Public key cryptography protocols, such as RSA and elliptic curve cryptography, will be rendered insecure by Shor’s algorithm when large-scale quantum computers are built.
Utsav Banerjee +2 more
doaj +1 more source
Not-so-adiabatic quantum computation for the shortest vector problem
Since quantum computers are known to break the vast majority of currently used cryptographic protocols, a variety of new protocols are being developed that are conjectured, but not proved, to be safe against quantum attacks.
David Joseph +3 more
doaj +1 more source
PiouCrypt: Decentralized lattice-based method for visual symmetric cryptography
In recent years, establishing secure visual communications has turned into one of the essential problems for security engineers and researchers. However, only limited novel solutions are provided for image encryption, and limiting visual cryptography to ...
Navid Abapour, Mohsen Ebadpour
doaj +1 more source
Physical Protection of Lattice-Based Cryptography [PDF]
The impending realization of scalable quantum computers will have a significant impact on today's security infrastructure. With the advent of powerful quantum computers public key cryptographic schemes will become vulnerable to Shor's quantum algorithm, undermining the security current communications systems.
Khalid, Ayesha +5 more
openaire +3 more sources

