Results 11 to 20 of about 2,231 (134)

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, X. Bonnetain, E. Kirshanova, A. Schrottenloher, F. Song   +4 more
wiley   +1 more source

Single-Trace Attacks on Message Encoding in Lattice-Based KEMs

IEEE Access, 2020
In this article, we propose single-trace side-channel attacks against lattice-based key encapsulation mechanisms (KEMs) that are the third-round candidates of the national institute of standards and technology (NIST) standardization project. Specifically,
Bo-Yeon Sim, Jihoon Kwon, Joohee Lee, Il-Ju Kim, Tae-Ho Lee, Jaeseung Han, Hyojin Yoon, Jihoon Cho, Dong-Guk Han   +8 more
doaj   +1 more source

NTRU Prime: Reducing Attack Surface at Low Cost [PDF]

, 2017
Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leading proposals for post-quantum lattice-based cryptography, including the classic NTRU cryptosystem and typical Ring-LWE-based cryptosystems.
Bernstein, Daniel J., Chuengsatiansup, Chitchanok, Lange, Tanja, van Vredendaal, Christine   +3 more
openaire   +5 more sources

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 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, Fuqun Wang, Renjun Zhang, Bin Lian, Lidong Han, Kefei Chen, Guowen Xu   +6 more
wiley   +1 more source

Hardness of Module‐LWE with Semiuniform Seeds from Module‐NTRU

IET Information Security, Volume 2023, Issue 1, 2023., 2023
The module learning with errors (MLWE) problem has attracted significant attention and has been widely used in building a multitude of lattice‐based cryptographic primitives. The hardness of the MLWE problem has been established for several variants, but most of the known results require the seed distribution (i.e., the distribution of matrix A) to be ...
Wenjuan Jia, Jiang Zhang, Baocang Wang, Youwen Zhu   +3 more
wiley   +1 more source

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, Brennen, Gavin K., Lee, Troy, Santha, Miklos, Tomamichel, Marco   +4 more
core   +3 more sources

Improved lattice enumeration algorithms by primal and dual reordering methods

IET Information Security, Volume 17, Issue 1, Page 35-45, January 2023., 2023
Abstract The security of lattice‐based cryptosystems is generally based on the hardness of the Shortest Vector Problem (SVP). The original enumeration (ENUM) algorithm solving SVP runs in exponential time due to the exhaustive search, which is used as a subroutine for the block Korkin–Zolotarev (BKZ) algorithm.
Kazuki Yamamura, Yuntao Wang, Eiichiro Fujisaki   +2 more
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, Castryck Wouter, Szepieniec Alan, Vercauteren Frederik   +3 more
doaj   +1 more source

A Subfield Lattice Attack on Overstretched NTRU Assumptions:Cryptanalysis of Some FHE and Graded Encoding Schemes [PDF]

, 2016
International ...
A Ferraguti, A Langlois, AK Lenstra, BD Sittinger, C Gentry, C Löndahl, C-P Schnorr, Chris Peikert, Craig Gentry, D Coppersmith, D Stehlé, D Stehlé, G Hanrot, HW Lenstra, J Hoffstein, J Hoffstein, J-F Biasse, J-F Biasse, J. M. Pollard, Jean-Sébastien Coron, Jeffrey Hoffstein, JW Bos, K Eisenträger, L Lovasz, LC Washington, Léo Ducas, MR Albrecht, N Howgrave-Graham, P Samuel, Paul Kirchner, R Cramer, S Garg, T Lepoint, V Lyubashevsky, W Castryck, Y Chen, Y Doröz, Yara Elias   +37 more
core   +5 more sources