Results 21 to 30 of about 3,960 (217)
A Complete Public-Key Cryptosystem [PDF]
Groups – Complexity – Cryptology, 2009 We present a cryptosystem which is complete for the class of probabilistic public-key cryptosystems with bounded error. Besides traditional encryption schemes such as RSA and El Gamal, this class contains probabilistic encryption of Goldwasser-Micali as well as Ajtai-Dwork and NTRU cryptosystems.
Grigoriev, D., Hirsch, E., Pervyshev, K.
openaire +4 more sources
A New Attack on NTRU Public Key Cryptosystem Depend on Using Public Key and Public Information [PDF]
Engineering and Technology Journal, 2010 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
Key-Insulated Public Key Cryptosystems [PDF]
, 2002 Cryptographic computations (decryption, signature generation, etc.) are often performed on a relatively insecure device (e.g., a mobile device or an Internet-connected host) which cannot be trusted to maintain secrecy of the private key. We propose and investigate the notion of key-insulated security whose goal is to minimize the damage caused by ...
Yevgeniy Dodis +3 more
openaire +2 more sources
Hexi McEliece public key cryptosystem [PDF]
, 2014 This paper introduces a new class of hexi codes namely, hexi polynomial codes, hexi Rank Distance codes, hexi Maximum Rank Distance codes, hexi Goppa codes and hexi wild Goppa codes.
Ilanthenral, K. +3 more
core +1 more source
Quantum Public-Key Cryptosystems [PDF]
, 2000 This paper presents a new paradigm of cryptography, quantum public-key cryptosystems. In quantum public-key cryptosystems, all parties including senders, receivers and adversaries are modeled as quantum (probabilistic) poly-time Turing (QPT) machines and only classical channels (i.e., no quantum channels) are employed.
Tatsuaki Okamoto +2 more
openaire +1 more source
The Digital Signature of Blum-Goldwasser Probobilistic Public Key Cryptosystem [PDF]
, 1999 The digital signature algorithm for Blum-Goldwasser probabilistic public key cryptosystem is proposed. In the proposed cryptosystem both encryption and digita1 signature can be done at the same time. The security of the proposed cryptosystem is not lower
ODAKA, Tomohiro +7 more
core +1 more source
A new code‐based digital signature based on the McEliece cryptosystem
IET Communications, 2023 Digital signature schemes are used for the authentication and verification of signatures. The Courtois–Finiasz–Sendrier (CFS) digital signature is a well‐known code‐based digital signature scheme based on the Niederreiter cryptosystem. However, it is not
Farshid Haidary Makoui +2 more
doaj +1 more source
The GH Public-Key Cryptosystem [PDF]
, 2001 This paper will propose an efficient algorithm that utilizes the signed-digit representation to compute the kth term of a characteristic sequence generated by a linear feedback shift register of order 3 over GF(q). We will also propose an efficient algorithm to compute the (h-dk)th term of the characteristic sequence based on the knowledge of the kth ...
Guang Gong, Lein Harn, Huapeng Wu
openaire +1 more source
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEM [PDF]
, 2009 In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*. However Patarin latter found that Little Dragon cryptosystem is not secure [8], [3].
Rajesh P Singh +3 more
core +1 more source
CQTRU: A Commutative Quaternions Rings Based Public Key Cryptosystem [PDF]
Engineering and Technology Journal, 2016 In this paper, we propose a new version of the NTRU public key cryptosystem called CQTRU. It is a four-dimensional cryptosystem based on the commutative quaternion ring.
Nadia M.G. Alsaidi +2 more
doaj +1 more source