Results 21 to 30 of about 2,293 (163)
Quantum attacks on Bitcoin, and how to protect against them [PDF]
, 2017 The key cryptographic protocols used to secure the internet and financial transactions of today are all susceptible to attack by the development of a sufficiently large quantum computer.
Aggarwal, Divesh +4 more
core +3 more sources
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
IET Information Security, Volume 17, Issue 2, Page 171-209, March 2023., 2023 Abstract In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post‐quantum secure cryptosystems.
J.‐F. Biasse +4 more
wiley +1 more source
Lattice‐based cryptosystems in standardisation processes: A survey
IET Information Security, Volume 17, Issue 2, Page 227-243, March 2023., 2023 Abstract The current widely used public‐key cryptosystems are vulnerable to quantum attacks. To prepare for cybersecurity in the quantum era, some projects have been launched to call for post‐quantum alternatives. Due to solid security and desirable performance, lattice‐based cryptosystems are viewed as promising candidates in the upcoming ...
Anyu Wang, Dianyan Xiao, Yang Yu
wiley +1 more source
A framework for cryptographic problems from linear algebra
Journal of Mathematical Cryptology, 2020 We introduce a general framework encompassing the main hard problems emerging in lattice-based cryptography, which naturally includes the recently proposed Mersenne prime cryptosystem, but also problems coming from code-based cryptography.
Bootland Carl +3 more
doaj +1 more source
A Publicly Verifiable Leveled Fully Homomorphic Signcryption Scheme
IET Information Security, Volume 2023, Issue 1, 2023., 2023 With the deepening of research, how to construct a fully homomorphic signcryption scheme based on standard assumptions is a problem that we need to solve. For this question, recently, Jin et al. proposed a leveled fully homomorphic signcryption scheme from standard lattices.
Zhaoxuan Bian +6 more
wiley +1 more source
A Subfield Lattice Attack on Overstretched NTRU Assumptions:Cryptanalysis of Some FHE and Graded Encoding Schemes [PDF]
, 2016 International ...
A Ferraguti +37 more
core +5 more sources
Security considerations for Galois non-dual RLWE families [PDF]
, 2017 We explore further the hardness of the non-dual discrete variant of the Ring-LWE problem for various number rings, give improved attacks for certain rings satisfying some additional assumptions, construct a new family of vulnerable Galois number fields ...
D Micciancio +13 more
core +2 more sources
Towards Faster Cryptosystems, II [PDF]
, 2005 http://www.math.missouri.edu/~bbanks/papers/index.htmlWe discuss three cryptosystems, NTRU, SPIFI , and ENROOT, that are based on the use of polynomials with restricted ...
Banks, William David, 1964-
core +1 more source
Accelerating LTV based homomorphic encryption in reconfigurable hardware [PDF]
, 2015 After being introduced in 2009, the first fully homomorphic encryption (FHE) scheme has created significant excitement in academia and industry. Despite rapid advances in the last 6 years, FHE schemes are still not ready for deployment due to an ...
Doroz, Yarkin +6 more
core +1 more source
A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
Journal of Mathematical Cryptology, 2019 Over the past decade, the hybrid lattice-reduction and meet-in-the middle attack (called hybrid attack) has been used to evaluate the security of many lattice-based cryptographic schemes such as NTRU, NTRU Prime, BLISS and more.
Wunderer Thomas
doaj +1 more source