Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm [PDF]
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 +5 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
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
Lattice-based Threshold Secret Sharing Algorithm [PDF]
Jisuanji gongcheng, 2016 The secret sharing algorithm based on the traditional mathematical assumption is difficult to resist the attack of the quantum algorithm.Therefore,a lattice-based threshold secret sharing algorithm is proposed.The basic process of the secret sharing ...
ZHANG Hongjun,LIU Ke,MOU Zhansheng
doaj +1 more source
Long Prediction Horizon FCS-MPC for Power Converters and Drives
IEEE Open Journal of the Industrial Electronics Society, 2023 Finite control set model predictive control (FCS-MPC) is a salient control method for power conversion systems that has recently enjoyed remarkable popularity.
Eduardo Zafra +4 more
doaj +1 more source
Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography
Mathematics, 2021 The security of lattice-based cryptosystems is based on solving hard lattice problems such as the shortest vector problem (SVP) and the closest vector problem (CVP).
Hami Satılmış +2 more
doaj +1 more source
Improving BDD Enumeration for LWE Problem Using GPU
IEEE Access, 2020 In this paper, we present a GPU-based parallel algorithm for the Learning With Errors (LWE) problem using a lattice-based Bounded Distance Decoding (BDD) approach.
Mohamed S. Esseissah +2 more
doaj +1 more source
Practical seed-recovery for the PCG Pseudo-Random Number Generator
IACR Transactions on Symmetric Cryptology, 2020 The Permuted Congruential Generators (PCG) are popular conventional (non-cryptographic) pseudo-random generators designed in 2014. They are used by default in the NumPy scientific computing package.
Charles Bouillaguet +2 more
doaj +1 more source
Approximate Voronoi cells for lattices, revisited
Journal of Mathematical Cryptology, 2020 We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis–Laarhoven–De Weger [PQCrypto, 2019] of determining exact ...
Laarhoven Thijs
doaj +1 more source
Usage the lazy learning meta-heuristic technique for predicting entrepreneurial marketing in the insurance industry [PDF]
Journal of Applied Research on Industrial Engineering, 2021 Due to the increasing importance of marketing, entrepreneurship and the role of organizational structure in their application, the purpose of this research is to predict entrepreneurial marketing using an organizational structure in the insurance ...
Mohammad Javad Taghipourian +3 more
doaj +1 more source