Results 31 to 40 of about 12,088 (180)
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
NTRU-ν-um: Secure Fully Homomorphic Encryption from NTRU with Small Modulus
NTRUEncrypt is one of the first lattice-based encryption schemes. Furthermore, the earliest fully homomorphic encryption (FHE) schemes rely on the NTRU problem.
Kamil Kluczniak (17287801)
core +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
Polynomial equation in algebraic attack on NTRU-HPS and NTRU-HRSS [PDF]
NTRU is a lattice-based public-key cryptosystem designed by Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998.
Paradise Fadila, Sugeng Kiki Ariyanti
doaj +1 more source
Q-NTRU Cryptosystem for IoT Applications
Interesting in the Internet of things (IoT) has begun to grow rapidly since it deals with the everyday needs of humans and becomes dealing with a huge amount of personal information. This expansion is accompanied by a number of challenges; one of them is the need for solving the problem of security challenges by using algorithms with high security and ...
Omar Sapti Guma'a +2 more
openaire +2 more sources
A New Provably Secure Cryptosystem Using Dedekind Domain Direct Product Approach
We would like to prevent, detect, and protect communication and information systems' attacks, which include unauthorized reading of a message of file and traffic analysis or active attacks, such as modification of messages or files, and denial of service
Amir Hassani Karbasi
doaj +1 more source

