China
Africa
Explore chapters and articles related to this topic
Post-Quantum Cryptography
Published in Khaleel Ahmad, M. N. Doja, Nur Izura Udzir, Manu Pratap Singh, Emerging Security Algorithms and Techniques, 2019
Amandeep Singh Bhatia, Ajay Kumar
The security of GGH cryptosystem depends upon selecting a suitable perturbation vector r. If it is selected very small, then the closest vector v can be easily retrieved without any difficulty. If it is selected very large, then it may be not possible to decrypt using the private key. Hence, the perturbation vector r must be chosen balanced, i.e., relatively small as compared to the vectors in public key W. The advantages of lattice-based cryptography are as follows: till now, any quantum attacks do not exist to break lattice-based cryptosystems, and it is one of chief substitutes for post-quantum cryptosystems. The main disadvantages of lattice-based cryptography are as follows: lattice-based cryptosystems are not applied much yet due to security reasons (Nguyen and Regev, 2009). NTRU is efficient in implementation but lacks in security.
Quantum-Safe Asymmetric Cryptosystems
Published in Shashi Bhushan, Manoj Kumar, Pramod Kumar, Renjith V. Ravi, Anuj Kumar Singh, Holistic Approach to Quantum Cryptography in Cyber Security, 2023
Sagarika Ghosh, Marzia Zaman, Srinivas Sampalli
Lattice-based cryptography has been proven to be strongly resistant to subexponential as well as quantum threats. They are based on the concept of lattices, sets of points within an n-size periodic structured space as shown in Figure 6.1 [13]. In simple terms, lattice can be considered as any regularly spaced grid of points. The security of the lattice-based cryptography depends on the complexity of lattice problems, mainly the shortest vector problem (SVP), the closest vector problem (CVP), or the shortest independent vector problem (SIVP) [7,13]. The SVP is deriving the minimum nonzero vector in the current lattice and is an NP-hard problem, unsolvable by the present quantum algorithm [7].
A secure lattice-based anonymous authentication scheme for VANETs
Published in Journal of the Chinese Institute of Engineers, 2019
Hui Liu, Yining Sun, Yan Xu, Rui Xu, Zhuo Wei
We can conclude from Table 1 that the proposed scheme needs no TPD which can not resist against side-channel attacks. In addition, this scheme is constructed using lattice-based cryptography. This scheme is secure against forgery attack assuming SIS-problem is hard. The security of lattice-based cryptography is based on the worst-case hardness of lattice problems which is conjectured to be hard even for quantum computers (Regev 2006). Therefore, the proposed scheme can achieve postquantum security.