Results 1  10
of
15,872
Timing Attacks on Implementations of DiffieHellman, RSA, DSS, and Other Systems
, 1996
"... By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed DiffieHellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known cip ..."
Abstract

Cited by 644 (3 self)
 Add to MetaCart
By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed DiffieHellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known
Cryptanalysis of short RSA secret exponents
 IEEE Trans. Inform. Theory
, 1990
"... Abstract. A cryptanalytic attack on the use of short RSA secret exponents is described. This attack makes use of an algorithm based on continued fractions which finds the numerator and denominator of a fraction in polynomial time when a close enough estimate of the fraction is known. The public expo ..."
Abstract

Cited by 170 (1 self)
 Add to MetaCart
approximately the same number of bits, this attack will discover secret exponents with up to approximately onequarter as many bits as the modulus. Ways to combat this attack, ways to improve it, and two open problems are described. This attack poses no threat to the normal case of RSA where the secret exponent
A Digital Signature Scheme Secure Against Adaptive ChosenMessage Attacks
, 1995
"... We present a digital signature scheme based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosenmessage attack: an adversary who receives signatures for messages of his choice (where each message may be chosen in a ..."
Abstract

Cited by 985 (43 self)
 Add to MetaCart
We present a digital signature scheme based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosenmessage attack: an adversary who receives signatures for messages of his choice (where each message may be chosen
Short Private Exponent Attacks on Fast Variants of RSA
 UCL Crypto Group Technical Report Series CG2003/4, Université Catholique de Louvain
, 2002
"... In this report, we study the adaptation of existing attacks on short private exponent on fast variants of the wellknown RSA publickey cryptosystem, namely the RSA Multiprime and the Takagi family cryptosystems. The first one consists in a variant whose modulus is made up with strictly more tha ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
In this report, we study the adaptation of existing attacks on short private exponent on fast variants of the wellknown RSA publickey cryptosystem, namely the RSA Multiprime and the Takagi family cryptosystems. The first one consists in a variant whose modulus is made up with strictly more
Encrypted Key Exchange: PasswordBased Protocols Secure Against Dictionary Attacks
 IEEE SYMPOSIUM ON RESEARCH IN SECURITY AND PRIVACY
, 1992
"... Classical cryptographic protocols based on userchosen keys allow an attacker to mount passwordguessing attacks. We introduce a novel combination of asymmetric (publickey) and symmetric (secretkey) cryptography that allow two parties sharing a common password to exchange confidential and authenti ..."
Abstract

Cited by 431 (5 self)
 Add to MetaCart
Classical cryptographic protocols based on userchosen keys allow an attacker to mount passwordguessing attacks. We introduce a novel combination of asymmetric (publickey) and symmetric (secretkey) cryptography that allow two parties sharing a common password to exchange confidential
Low Secret Exponent RSA Revisited
, 2001
"... We present a lattice attack on low exponent RSA with short secret exponent d = N^x for every x < 0:265. Our method as well as the method by Boneh and Durfee is a heuristic, since the method is based on Coppersmith's approach for bivariate polynomials. Coppersmith [6] pointed out that this he ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
We present a lattice attack on low exponent RSA with short secret exponent d = N^x for every x < 0:265. Our method as well as the method by Boneh and Durfee is a heuristic, since the method is based on Coppersmith's approach for bivariate polynomials. Coppersmith [6] pointed out
Ariadne: A secure ondemand routing protocol for ad hoc networks
, 2002
"... An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a n ..."
Abstract

Cited by 900 (11 self)
 Add to MetaCart
nonadversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure ondemand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes
Continued fractions and RSA with small secret exponent
 Tatra Mt. Math. Publ
"... Abstract. Extending the classical Legendre’s result, we describe all solutions of the inequality α − a/b  < c/b 2 in terms of convergents of continued fraction expansion of α. Namely, we show that a/b = (rpm+1 ±spm)/(rqm+1 ±sqm) for some nonnegative integers m, r, s such that rs < 2c. As an ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
. As an application of this result, we describe a modification of Verheul and van Tilborg variant of Wiener’s attack on RSA cryptosystem with small secret exponent. 1.
A Pairwise Key PreDistribution Scheme for Wireless Sensor Networks
, 2003
"... this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an indepth analysis of our scheme in terms of network resili ..."
Abstract

Cited by 554 (18 self)
 Add to MetaCart
scale network breaches to an adversary, and makes it necessary for the adversary to attack a large fraction of the network before it can achieve any significant gain
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.
Results 1  10
of
15,872