Results 21 to 30 of about 177 (153)
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
Transactions on Cryptographic Hardware and Embedded Systems, 2023 The main protection against side-channel attacks consists in computing every function with multiple shares via the masking countermeasure. While the masking countermeasure was originally developed for securing block-ciphers such as AES, the protection ...
Jean-Sébastien Coron +3 more
doaj +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
Kyber, Saber, and SK‐MLWR Lattice‐Based Key Encapsulation Mechanisms Model Checking with Maude
IET Information Security, Volume 2023, Issue 1, 2023., 2023 Facing the potential threat raised by quantum computing, a great deal of research from many groups and industrial giants has gone into building public‐key post‐quantum cryptographic primitives that are resistant to the quantum attackers. Among them, there is a large number of post‐quantum key encapsulation mechanisms (KEMs), whose purpose is to provide
Duong Dinh Tran +5 more
wiley +1 more source
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 +2 more
wiley +1 more source
LaTLS: A Lattice‐Based TLS Proxy Protocol
Chinese Journal of Electronics, Volume 31, Issue 2, Page 313-321, March 2022., 2022 The function of the Internet proxy is to check and convert the data exchanged between client and server. In fact, the two‐party secure communication protocol with good security is turned into an unsafe multiparty protocol. At present, there are relatively few proxy protocols that can be applied in practice.
Xinglong ZHANG +2 more
wiley +1 more source
Lattice‐based hash‐and‐sign signatures using approximate trapdoor, revisited
IET Information Security, Volume 16, Issue 1, Page 41-50, January 2022., 2022 Abstract For the purpose of improving the efficiency of the cryptosystems built upon lattice trapdoors, Chen, Genise and Mukherjee at ASIACRYPT 2019 modified the gadget trapdoor (G‐trapdoor) to an approximate trapdoor, which enables one to sample short preimages approximately from a discrete Gaussian distribution.
Huiwen Jia, Yupu Hu, Chunming Tang
wiley +1 more source
Efficient Implementation of NTRU Cryptosystem Using Sliding Window Methods
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2013 Mun-Kyu Lee, Jung Woo Kim, Kunsoo Park
exaly +2 more sources
Information, 2022 At present, secure multi-party computing is an effective solution for organizations and institutions that want to derive greater value and benefit from the collaborative computing of their data.
Yongbo Jiang, Yuan Zhou, Tao Feng
doaj +1 more source
Generalisations of NTRU cryptosystem
Security and Communication Networks, 2016 AbstractSince the proposal of NTRU cryptosystem, many variants were proposed by the researcher using different‐different algebraic structure. In this article, we try to explore the existing variants of NTRU cryptosystem with their comparative study. Copyright © 2016 John Wiley & Sons, Ltd.
Sonika Singh, Sahadeo Padhye
openaire +1 more source