Results 1  10
of
1,799,396
Quantum publickey cryptosystems
 in Proc. of CRYPT0 2000
, 2000
"... Abstract. This paper presents a new paradigm of cryptography, quantum publickey cryptosystems. In quantum publickey cryptosystems, all parties including senders, receivers and adversaries are modeled as quantum (probabilistic) polytime Turing (QPT) machines and only classical channels (i.e., no q ..."
Abstract

Cited by 37 (2 self)
 Add to MetaCart
Abstract. This paper presents a new paradigm of cryptography, quantum publickey cryptosystems. In quantum publickey cryptosystems, all parties including senders, receivers and adversaries are modeled as quantum (probabilistic) polytime Turing (QPT) machines and only classical channels (i
On DRSA Public Key Cryptosystem
, 2005
"... Abstract: The standard RSA cryptosystem is not semantically secure. Pointcheviel proposed a variant of RSA cryptosystem with the property of semantic security by introducing a new problem known as DRSA problem. He called it DRSA scheme. In this paper, we underlined a shortcoming of that scheme and p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and proposed an alternative DRSA public key cryptosystem.
Distributed Public Key Cryptosystems
, 1998
"... The cryptographic community has developed many tools to incorporate distributed trust mechanisms into cryptographic primitives and protocols as well as primitives where parties are naturally distributed. Since the fastest growing paradigm in computing is distributed systems and communication networ ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
networks, the importance of distributed mechanisms has been increasing, and will likely to be pervasive in the future. Here, we review the various distributed mechanisms that have been developed and applied to achieve distributed public key cryptosystem. We focus primarily on the more efficient threshold
A Survey of PublicKey Cryptosystems
 SIAM Review 46 (2004) 599– 634. OVERVIEW OF BRAID GROUP CRYPTOGRAPHY 13
"... We give an overview of the most important publickey cryptosystems and discuss the di#cult task of evaluating the merit of such systems. ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
We give an overview of the most important publickey cryptosystems and discuss the di#cult task of evaluating the merit of such systems.
A public key cryptosystem and a signature scheme based on discrete logarithms
 Adv. in Cryptology, SpringerVerlag
, 1985
"... AbstractA new signature scheme is proposed, together with an implementation of the DiffieHellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields. I. ..."
Abstract

Cited by 1520 (0 self)
 Add to MetaCart
AbstractA new signature scheme is proposed, together with an implementation of the DiffieHellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields. I.
A New PublicKey Cryptosystem
, 1997
"... This paper describes a new publickey cryptosystem where the ciphertext is obtained by multiplying the publickeys indexed by the message bits and the cleartext is recovered by factoring the ciphertext raised to a secret power. ..."
Abstract

Cited by 43 (5 self)
 Add to MetaCart
This paper describes a new publickey cryptosystem where the ciphertext is obtained by multiplying the publickeys indexed by the message bits and the cleartext is recovered by factoring the ciphertext raised to a secret power.
Multivariate public key cryptosystems
 Advances in Information Security
, 2006
"... Recently Landau and Diffie gave in a series of articles in the Notices of the American Mathematical Society [DL02, Lan01, Lan00a, Lan00b] and in the American Mathematical Monthly [Lan04] excellent expositions on how the theory of multivariable polynomials are used in cryptography. However ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
Recently Landau and Diffie gave in a series of articles in the Notices of the American Mathematical Society [DL02, Lan01, Lan00a, Lan00b] and in the American Mathematical Monthly [Lan04] excellent expositions on how the theory of multivariable polynomials are used in cryptography. However
The GH Publickey Cryptosystem
 PROCEEDINGS OF SELECTED AREAS IN CRYPTOGRAPHY (SAC) 2001, LNCS 2259
, 2001
"... This paper will propose an ecient algorithm that utilizes the signeddigit 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 ecient algorithm to compute the (h dk)th term of the character ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
of the characteristic sequence based on the knowledge of the kth term where k is unknown. Incorporating these results, we construct the ElGamallike digital signature algorithm for the publickey cryptography based on the 3rdorder characteristic sequences which was proposed by Gong and Harn in 1999.
Cryptanalysis of the HFE Public Key Cryptosystem
, 1999
"... The RSA public key cryptosystem is based on a single modular equation in one variable. A natural generalization of this approach is to consider systems of several modular equations in several variables. In this paper we consider Patarin's Hidden Field Equations (HFE) scheme, which is believ ..."
Abstract

Cited by 116 (1 self)
 Add to MetaCart
The RSA public key cryptosystem is based on a single modular equation in one variable. A natural generalization of this approach is to consider systems of several modular equations in several variables. In this paper we consider Patarin's Hidden Field Equations (HFE) scheme, which
PublicKey Cryptosystem Based On
, 2006
"... A new general mathematical problem, suitable for publickey cryptosystems, is proposed: morphism computation in a category of Abelian groups. In connection with elliptic curves over finite fields, the problem becomes the following: compute an isogeny (an algebraic homomorphism) between the ellipt ..."
Abstract
 Add to MetaCart
the elliptic curves given. The problem seems to be hard for solving with a quantum computer. ElGamal publickey encryption and Di#eHellman key agreement are proposed for an isogeny cryptosystem. The paper describes theoretical background and a publickey encryption technique, followed by security analysis
Results 1  10
of
1,799,396