Results 1 to 10 of about 6,692,580 (276)
Variational quantum solutions to the Shortest Vector Problem [PDF]
Quantum, 2023 A fundamental computational problem is to find a shortest non-zero vector in Euclidean lattices, a problem known as the Shortest Vector Problem (SVP).
Martin R. Albrecht +3 more
doaj +11 more sources
An Efficient Algorithm for the Shortest Vector Problem
IEEE Access, 2018 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 +6 more sources
A Review of Sieve Algorithms in Solving the Shortest Lattice Vector Problem [PDF]
IEEE Access, 2020 As a category of algorithms to solve the shortest lattice vector problem, sieve algorithms have drawn more and more attention due to the prominent performance in recent years.
Zedong Sun, Chunxiang Gu, Yonghui Zheng
doaj +4 more sources
Not-so-adiabatic quantum computation for the shortest vector problem [PDF]
Physical Review Research, 2020 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 +2 more sources
Improved lower bound for the complexity of unique shortest vector problem
Cybersecurity, 2023 Unique shortest vector problem (uSVP) plays an important role in lattice based cryptography. Many cryptographic schemes based their security on it. For the cofidence of those applications, it is essential to clarify the complexity of uSVP with different ...
Baolong Jin, Rui Xue
doaj +2 more sources
A short text entity disambiguation method based on BERT model and shortest path algorithm [PDF]
Scientific ReportsEntity disambiguation is an important task in natural language processing that addresses situations where entity names mentioned in text may correspond to multiple real-world entities, with the goal of disambiguation by mapping entity names mentioned in ...
Xiaodong Liu +8 more
doaj +2 more sources
The Mathematical Foundation of Post-Quantum Cryptography [PDF]
ResearchIn 1994, P. Shor discovered quantum algorithms that can break both the RSA cryptosystem and the ElGamal cryptosystem. In 2007, a Canadian company D-Wave demonstrated the first quantum computer.
Chuanming Zong
doaj +2 more sources
Algorithms, 2021 In this work, we give provable sieving algorithms for the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP) on lattices in ℓp norm (1≤p≤∞). The running time we obtain is better than existing provable sieving algorithms.
Priyanka Mukhopadhyay
doaj +1 more source
Lattice Attacks on NTRU Revisited
IEEE Access, 2021 NTRU cryptosystem was proposed by J. Hoffstein, J.Pipher and J.H. Silverman in 1996, whose security is related to the hardness of finding sufficient short vectors in NTRU lattice with dimension $2N$ .
Jingguo Bi, Lidong Han
doaj +1 more source
Application of hourglass matrix in Goldreich-Goldwasser-Halevi encryption scheme
Journal of Nigerian Society of Physical Sciences, 2022 Goldreich-Goldwasser-Halevi (GGH) encryption scheme is lattice-based cryptography with its security based on the shortest vector problem (SVP) and closest vector problem (CVP) with immunity to almost all attacks, including Shor's quantum algorithm and ...
Olayiwola Babarinsa +6 more
doaj +1 more source