Results 41 to 50 of about 12,088 (180)
The advent of quantum computing with high processing capabilities will enable brute force attacks in short periods of time, threatening current secure communication channels.
Eros Camacho-Ruiz +3 more
doaj +1 more source
New Public Key Cryptosystem (First Version) [PDF]
In this article, we propose a new public key cryptosystem, called \textbf{NAB}. The most important features of NAB are that its security strength is no easier than the security issues of the NTRU cryptosystem~\cite{Hoffstein96} and the encryption ...
Hatem M. Bahig, M. Anwar, Dieaa I. Nassr
core +1 more source
Secure data storage and access for fish monitoring in cloud environment
Cloud computing (CC) refers to the on-demand availability of computer system resources, specifically data storage and computational power, without the user's direct active administration.
K.S. Saraswathy, S.S. Sujatha
doaj +1 more source
A framework for cryptographic problems from linear algebra
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
Structure a Public-Key Cryptosystem Based on HSS Algebra [PDF]
NTRU (Number theory research unit) is a public key cryptosystem that uses lattice-based cryptography. It is more resistant to assaults than other commonly used public-key cryptosystems, and its performance has been proven to be much better.
Rashed Yassein, Hassan +1 more
core +1 more source
A Simple and Efficient Key Reuse Attack on NTRU Cryptosystem [PDF]
In 1998, Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman introduced the famous NTRU cryptosystem, and called it A ring-based public key cryptosystem .
Joshua Deaton +4 more
core +1 more source
On the distribution of Low Hamming Weight products
Jeffrey Hoffstein et al. (Discrete Appl. Math. 130:37–49, 2003) introduced the Low Hamming Weight products (LHWP) X = x 1 x 2 x 3 $X=x_{1}x_{2}x_{3}$ as random exponent of elements in a group or a ring to improve the operational efficiency, where each x ...
Jianghua Li, Qiao Li
doaj +1 more source
Understanding the NTRU Cryptosystem [PDF]
In this paper, we will examine the NTRU Public Key Cryptosystem. The NTRU cryptosystem was created by Joseph Silverman, Jeffery Hoffstein, and Jill Pipher in 1996. This system uses truncated polynomial rings to encrypt and decrypt data.
Clark, Benjamin
core
The rapid expansion of the Industrial Internet of Things (IIoT) presents pressing challenges for secure, efficient, and privacy‐preserving communication among users, sensors, and cloud infrastructures. Existing lightweight authentication schemes, primarily based on classical cryptographic assumptions, are increasingly vulnerable to the emerging threat ...
Tinashe Magara +2 more
wiley +1 more source
A connection between cryptography and polynomial functions is extremely significant. Mathematical performance of polynomials helps to enhance the cryptographic primitives, which are trustworthy as well as straightforward representation tools, in everyday use. In this research, explicit topological sequences Qf which correspond to degree‐based, distance‐
Mohammad Mazyad Hazzazi +5 more
wiley +1 more source

