Results 21 to 30 of about 175 (163)
Kyber, Saber, and SK‐MLWR Lattice‐Based Key Encapsulation Mechanisms Model Checking with Maude
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
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
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
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
Forward‐secure revocation is a powerful cryptographic technique to alleviate key exposure attacks on identity‐based cryptosystems. In recent years, quantum computers have made some breakthroughs, so in the foreseeable future, existing cryptographic systems will be subject to quantum attacks.
Yan He +5 more
wiley +1 more source
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
A New Attack on NTRU Public Key Cryptosystem Depend on Using Public Key and Public Information [PDF]
This paper proposed a new method to attack the NTRU cryptosystem [Hof00a,Hof98b]. It tried to exploit the public information about the parameters of NTRUcryptosystem and using the public key, to recover the private keys without delvingin the detail of ...
Abdul Monem S.Rahma +1 more
doaj +1 more source
Curse of Re-encryption: A Generic Power/EM Analysis on Post-Quantum KEMs
This paper presents a side-channel analysis (SCA) on key encapsulation mechanism (KEM) based on the Fujisaki–Okamoto (FO) transformation and its variants.
Rei Ueno +5 more
doaj +1 more source
Generalisations of NTRU cryptosystem
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
MaTRU: A New NTRU-Based Cryptosystem [PDF]
In this paper, we propose a new variant of the NTRU public key cryptosystem – the MaTRU cryptosystem. MaTRU works under the same general principles as the NTRU cryptosystem, except that it operates in a different ring with a different linear transformation for encryption and decryption.
Michael Coglianese, Bok-Min Goi
openaire +1 more source

