Results 11  20
of
16,702
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 Security of the Gabidulin Public Key Cryptosystem
, 1996
"... The Gabidulin Public Key Cryptosystem (PKC), like the well known McEliece PKC, is based on error correcting codes, and was introduced as an alternative to the McEliece system with the claim that much smaller codes could be used, resulting in a more practical system. ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The Gabidulin Public Key Cryptosystem (PKC), like the well known McEliece PKC, is based on error correcting codes, and was introduced as an alternative to the McEliece system with the claim that much smaller codes could be used, resulting in a more practical system.
Generalizations of RSA Public Key Cryptosystem
, 2005
"... In this paper, for given N = pq with p and q different odd primes, and m = 1, 2, , we give a public key cryptosystem. When m = 1 the system is just the famous RSA system. And when m 2, the system is usually more secure than the one with m = 1. ..."
Abstract
 Add to MetaCart
In this paper, for given N = pq with p and q different odd primes, and m = 1, 2, , we give a public key cryptosystem. When m = 1 the system is just the famous RSA system. And when m 2, the system is usually more secure than the one with m = 1.
Complexity measures for publickey cryptosystems
 SIAM Journal on Computing
, 1988
"... The first part of this paper gives results about promise problems. A "promise problem " is a formulation of a partial decision problem that is useful for describing cracking problems for publickey cryptosystems (PKCS). We prove that every NPhard promise problem is uniformly NPhard ..."
Abstract

Cited by 148 (15 self)
 Add to MetaCart
The first part of this paper gives results about promise problems. A "promise problem " is a formulation of a partial decision problem that is useful for describing cracking problems for publickey cryptosystems (PKCS). We prove that every NPhard promise problem is uniformly NP
RSA Public Key Cryptosystem
, 2000
"... This report describes briey the current research in both hardware and software for fast evaluation of RSA, which consists of computing powers modulo a large number n. The two aspects namely trying to increase the speed of multiplications and reducing the number of multiplications are considered. We ..."
Abstract
 Add to MetaCart
This report describes briey the current research in both hardware and software for fast evaluation of RSA, which consists of computing powers modulo a large number n. The two aspects namely trying to increase the speed of multiplications and reducing the number of multiplications are considered. We discuss heuristics in literature to reduce the number of multiplications for the computation of a given power and then present a heuristic that most of the times performs better than the best known so far. The second part is a survey on hardware implementations to make multiplications faster. 1
Chinks in the Armor of Public Key Cryptosystems
, 1994
"... Potential weaknesses in public key cryptosystem design and use are identified with emphasis on a particular vulnerability resulting from the encryption of ordinary natural language plaintext. This weakness occurs when an insufficiently long block length is used to encrypt low entropy natural languag ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Potential weaknesses in public key cryptosystem design and use are identified with emphasis on a particular vulnerability resulting from the encryption of ordinary natural language plaintext. This weakness occurs when an insufficiently long block length is used to encrypt low entropy natural
A Matricial Public Key Cryptosystem with
 Digital Signature  WSEAS TRANSACTIONS on MATHEMATICS Manuscript received Nov. 28, 2007; revised
, 2008
"... Abstract: We describe a new public key cryptosystem using block upper triangular matrices with elements in pZ, based on a generalization of the discrete logarithm problem over a finite group. The proposed cryptosystem is very efficient, requiring very few operations and also allows an ElGamal based ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract: We describe a new public key cryptosystem using block upper triangular matrices with elements in pZ, based on a generalization of the discrete logarithm problem over a finite group. The proposed cryptosystem is very efficient, requiring very few operations and also allows an El
On Oleshchuk’s Public Key Cryptosystem
, 2004
"... This paper revisits a public key cryptosystem which is based on finite ChurchRosser stringrewriting systems. We consider some ideas for cryptanalysis and discuss issues concerning practical usage. It turns out that without changing crucial details of key generation this cryptosystem does not offer ..."
Abstract
 Add to MetaCart
This paper revisits a public key cryptosystem which is based on finite ChurchRosser stringrewriting systems. We consider some ideas for cryptanalysis and discuss issues concerning practical usage. It turns out that without changing crucial details of key generation this cryptosystem does
On PublicKey Cryptosystems Based on Combinatorial Group Theory
, 2005
"... We analyze and critique the publickey cryptosystem, based on combinatorial group theory, that was proposed by Wagner and Magyarik in 1984. This idea is actually not based on the word problem but on another, generally easier, premise problem. Moreover, the idea of the WagnerMagyarik system is v ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We analyze and critique the publickey cryptosystem, based on combinatorial group theory, that was proposed by Wagner and Magyarik in 1984. This idea is actually not based on the word problem but on another, generally easier, premise problem. Moreover, the idea of the WagnerMagyarik system
Results 11  20
of
16,702