Results 41 to 50 of about 1,784 (149)
A Logical XOR Operation for NTRU Cryptosystem
International Journal of Computer Applications, 2015 The NTRU public key cryptosystem was first presented by J. Hoffstein, J. H. Silverman and J. Pipher in 1996. This system is based on shortest and closest vector problem in a lattice and operations based on objects in a truncated polynomial ring. In this paper we propose new variant of NTRU cryptosystem which is based on logical exclusive OR operator ...
Khushboo Thakur, Bhanu Pratap
openaire +1 more source
An NTRU-like Message Recoverable Signature Algorithm
MathematicsAn important feature of Nyberg-Rueppel type digital signature algorithms is message recovery, this signature algorithm can recover the original information from the signature directly by the verifier in the verification phase after signing the message ...
Tingle Shen, Li Miao, Bin Hua, Shuai Li
doaj +1 more source
Security considerations for Galois non-dual RLWE families [PDF]
, 2017 We explore further the hardness of the non-dual discrete variant of the Ring-LWE problem for various number rings, give improved attacks for certain rings satisfying some additional assumptions, construct a new family of vulnerable Galois number fields ...
D Micciancio +13 more
core +2 more sources
Cloud Computing in the Quantum Era [PDF]
, 2019 Cloud computing has become the prominent technology of this era. Its elasticity, dynamicity, availability, heterogeneity, and pay as you go pricing model has attracted several companies to migrate their businesses' services into the cloud.
Kaiiali, Mustafa +2 more
core +2 more sources
Decrypting NTRU: An Introductory Mathematical Exploration of the NTRU Public Key Cryptosystem
, 2023 Provides an introductory analysis of the NTRU public key cryptosystem, including the mathematical background in which the system takes place, the specific workings of the system and how to break it, and a comparison to other relevant systems.
openaire +2 more sources
A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q [PDF]
, 2013 In this paper, we introduce a new scheme based on the hardness of factoring integers of the shape N = p2q. Our scheme uses a combination of modular linear and modular squaring. We show that the decryption is 1-to-1 which is a great advantage over Rabin's
Abu, Nur Azman +3 more
core
An identification scheme based on sparse polynomials [PDF]
, 2000 This is a preprint of a book chapter published in Lecture Notes in Computer Science,1751, Springer-Verlag, Berlin (2000). The original publication is available at www.springerlink.com.This paper gives a new example of exploiting the idea of using ...
Banks, William David, 1964- +2 more
core +1 more source
Separable Reversible Data Hiding Scheme in Homomorphic Encrypted Domain Based on NTRU
IEEE Access, 2020 NTRU (Number Theory Research Unit) has the characteristics of resistance to quantum computing attacks, fast encryption and decryption, and high security. It is very suitable for wireless confidential data networks and authentication systems.
Neng Zhou +4 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 +37 more
core +5 more sources
A Variant of NTRU with Non-Invertible Polynomials [PDF]
, 2002 This is a preprint of a book chapter published in Lecture Notes in Computer Science, 2551, Springer-Verlag, Berlin (2003). The original publication is available at www.springerlink.com.We introduce a generalization of the NTRU cryptosystem and describe ...
Banks, William David, 1964- +1 more
core