Results 1  10
of
1,946
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 651 (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
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
, 1987
"... In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring is difficult ..."
Abstract

Cited by 1028 (1 self)
 Add to MetaCart
In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 542 (2 self)
 Add to MetaCart
family of volume rendering algorithms that reduces rendering times to one second. First we present a scanlineorder volume rendering algorithm that exploits coherence in both the volume data and the image. We show that scanlineorder algorithms are fundamentally more efficient than commonlyused ray
On the Importance of Checking Cryptographic Protocols for Faults
, 1997
"... We present a theoretical model for breaking various cryptographic schemes by taking advantage of random hardware faults. We show how to attack certain implementations of RSA and Rabin signatures. An implementation of RSA based on the Chinese Remainder Theorem can be broken using a single erroneous s ..."
Abstract

Cited by 405 (6 self)
 Add to MetaCart
. Schnorr's protocol can also be broken, but a larger number of erroneous executions is needed. Keywords: Hardware faults, Cryptanalysis, RSA, FiatShamir, Schnorr, Public key systems, Identification protocols. 1 Introduction Direct attacks on the famous RSA cryptosystem seem to require that one factor
Single View Metrology
, 1999
"... We describe how 3D affine measurements may be computed from a single perspective view of a scene given only minimal geometric information determined from the image. This minimal information is typically the vanishing line of a reference plane, and a vanishing point for a direction not parallel to th ..."
Abstract

Cited by 236 (4 self)
 Add to MetaCart
parallel to the reference plane (up to a common scale factor); (ii) compute area and length ratios on any plane parallel to the reference plane; (iii) determine the camera's (viewer's) location. Simple geometric derivations are given for these results. We also develop an algebraic representation
Further Attacks on ServerAided RSA Cryptosystems
, 1998
"... . Lim and Lee [5] describe protocols for serveraided RSA digital signatures involving moduli N with special structure: N = pq where p and q are both of order N 1=2 , and p \Gamma 1 and q \Gamma 1 have a large common factor fi. We describe a method to factor such numbers in time O \Gamma N 1= ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
. Lim and Lee [5] describe protocols for serveraided RSA digital signatures involving moduli N with special structure: N = pq where p and q are both of order N 1=2 , and p \Gamma 1 and q \Gamma 1 have a large common factor fi. We describe a method to factor such numbers in time O \Gamma N 1
© Science Publications 2006 Mathematical Attacks on RSA Cryptosystem
"... Abstract: In this paper some of the most common attacks against Rivest, Shamir, and Adleman (RSA) cryptosystem are presented. We describe the integer factoring attacks, attacks on the underlying mathematical function, as well as attacks that exploit details in implementations of the algorithm. Algor ..."
Abstract
 Add to MetaCart
Abstract: In this paper some of the most common attacks against Rivest, Shamir, and Adleman (RSA) cryptosystem are presented. We describe the integer factoring attacks, attacks on the underlying mathematical function, as well as attacks that exploit details in implementations of the algorithm
A Fast AutomatonBased Method for Detecting Anomalous Program Behaviors
 In Proceedings of the 2001 IEEE Symposium on Security and Privacy
, 2001
"... Forrest et al introduced a new intrusion detection approach that identifies anomalous sequences of system calls executed by programs. Since their work, anomaly detection on system call sequences has become perhaps the most successful approach for detecting novel intrusions. A natural way for learnin ..."
Abstract

Cited by 224 (5 self)
 Add to MetaCart
the learning as well as detection period. This factor leads to low overheads for intrusion detection. Unlike many of the previous techniques, our FSAtechnique can capture both short term and long term temporal relationships among system calls, and thus perform more accurate detection. For instance, the FSA
New Partial Key Exposure Attacks on RSA Revisited
, 2004
"... At CRYPTO 2003, Blömer and May presented new partial key exposure attacks against RSA. These were the first known polynomialtime partial key exposure attacks against RSA with public exponent e> N 1/2. Attacks for known most significant bits and known least significant bits were presented. In thi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to the RSA modulus. Some experimental bounds on the fraction of bits needed to mount the attacks are presented for some common RSA modulus sizes and small lattice dimensions. When using Coppersmith’s method for finding small roots of multivariate modular polynomials in cryptographic applications, it is often
Attack on RSA Cryptosystem
"... Abstract — The RSA cryptosystem is most widely used cryptosystem it may be used to provide both secrecy and digital signatures and its security is based on the intractability of the integer factorization. The security of RSA algorithm depends on the ability of the hacker to factorize numbers. New, f ..."
Abstract
 Add to MetaCart
, faster and better methods for factoring numbers are constantly being devised. The Trent best for long numbers is the Number Field Sieve. Although the past work has proven that none of the attacks on RSA cryptosystem were dangerous. Indeed most of the dangers were because of improper use of RSA
Results 1  10
of
1,946