Results 1  10
of
157
Cryptanalysis of Unbalanced RSA with Small CRTExponent
, 2002
"... We present latticebased attacks on RSA with prime factors p and q of unbalanced size. In our scenario, the factor q is smaller than N β and the decryption exponent d is small modulo p − 1. We introduce two approaches that both use a modular bivariate polynomial equation with a small root. Extract ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We present latticebased attacks on RSA with prime factors p and q of unbalanced size. In our scenario, the factor q is smaller than N β and the decryption exponent d is small modulo p − 1. We introduce two approaches that both use a modular bivariate polynomial equation with a small root
Distributed Cognition: Toward a New Foundation for HumanComputer Interaction Research
 ACM Transactions on ComputerHuman Interaction
, 2000
"... We are quickly passing through the historical moment when people work in front of a single computer, dominated by a small CRT and focused on tasks involving only local information. Networked computers are becoming ubiquitous and are playing increasingly significant roles in our lives and in the basi ..."
Abstract

Cited by 425 (5 self)
 Add to MetaCart
We are quickly passing through the historical moment when people work in front of a single computer, dominated by a small CRT and focused on tasks involving only local information. Networked computers are becoming ubiquitous and are playing increasingly significant roles in our lives
Key Recovery Method for CRT Implementation of RSA
, 2004
"... This paper analyzes a key recovery method for RSA signature generation or decryption implementations using the Chinese Remainder Theorem (CRT) speed up. The CRTbased RSA implementation is common in both low computing power devices and high speed cryptographic acceleration cards. This recovery metho ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
method is designed to work in conjunction with a sidechannel attack where the CRT exponents are discovered from a message decryption or signature generation operation, the public exponent is assumed small and the public modulus is unknown. Since many RSA implementations use the small, low hamming weight
A new attack on RSA and CRTRSA
"... Abstract. In RSA, the public modulus N = pq is the product of two primes of the same bitsize, the public exponent e and the private exponent d satisfy ed ≡ 1 (mod (p − 1)(q − 1)). In many applications of RSA, d is chosen to be small. This was cryptanalyzed by Wiener in 1990 who showed that RSA is i ..."
Abstract
 Add to MetaCart
Abstract. In RSA, the public modulus N = pq is the product of two primes of the same bitsize, the public exponent e and the private exponent d satisfy ed ≡ 1 (mod (p − 1)(q − 1)). In many applications of RSA, d is chosen to be small. This was cryptanalyzed by Wiener in 1990 who showed that RSA
Attacking Unbalanced RSACRT Using SPA
"... Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to make the computation of modular exponentiation as fast as possible. At PKC 2001, Novak has proposed to use some informatio ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to make the computation of modular exponentiation as fast as possible. At PKC 2001, Novak has proposed to use some
Ergonomics Considerations of LCD versus CRT Displays
"... Conventional computer systems have used cathode ray tube (CRT) technology for the computer display. However, in the past decade technological advances in thin film transistor (TFT) liquid crystal displays (LCDs) have made this an increasingly popular technology. From an ergonomics perspective, which ..."
Abstract
 Add to MetaCart
Conventional computer systems have used cathode ray tube (CRT) technology for the computer display. However, in the past decade technological advances in thin film transistor (TFT) liquid crystal displays (LCDs) have made this an increasingly popular technology. From an ergonomics perspective
Ridgelets: A key to higherdimensional intermittency?
, 1999
"... In dimensions two and higher, wavelets can efficiently represent only a small range of the full diversity of interesting behavior. In effect, wavelets are welladapted for pointlike phenomena, whereas in dimensions greater than one, interesting phenomena can be organized along lines, hyperplanes, and ..."
Abstract

Cited by 170 (11 self)
 Add to MetaCart
In dimensions two and higher, wavelets can efficiently represent only a small range of the full diversity of interesting behavior. In effect, wavelets are welladapted for pointlike phenomena, whereas in dimensions greater than one, interesting phenomena can be organized along lines, hyperplanes
A CRT Algorithm for Constructing Genus 2 Curves over Finite Fields
 ARITHMETIC, GEOMETRY AND CODING THEORY (AGCT10), 161– 76. SÉMINAIRES ET CONGRÈS 21. PARIS: SOCIÉTÉ MATHÉMATIQUE DE
, 2009
"... We present a new method for constructing genus 2 curves over a finite field Fn with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for discretelog based cryptosystems. Our algorithm provides an alte ..."
Abstract

Cited by 29 (11 self)
 Add to MetaCart
an alternative to the traditional CM method for constructing genus 2 curves. For a quartic CM field K with primitive CM type, we compute the Igusa class polynomials modulo p for certain small primes p and then use the Chinese remainder theorem (CRT) and a bound on the denominators to construct the class
New attacks on RSA with small secret CRTexponents
 PKC 2006. LNCS
, 2006
"... Abstract. It is wellknown that there is an efficient method for decrypting/signing with RSA when the secret exponent d is small modulo p − 1 and q − 1. We call such an exponent d a small CRTexponent. It is one of the major open problems in attacking RSA whether there exists a polynomial time attac ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Abstract. It is wellknown that there is an efficient method for decrypting/signing with RSA when the secret exponent d is small modulo p − 1 and q − 1. We call such an exponent d a small CRTexponent. It is one of the major open problems in attacking RSA whether there exists a polynomial time
click tab to visit website Ergonomic Considerations of LCD versus CRT Displays
"... Conventional computer systems have used cathode ray tube (CRT) technology for the computer display. However, in the past decade technological advances in thin fi lm transistor (TFT) liquid crystal displays (LCDs) have made this an increasingly popular technology. From an ergonomics perspective, whic ..."
Abstract
 Add to MetaCart
screen of text are 22 % faster for LCDs than CRTs, and also faster for low contrast, small characters. 1,2 – Eye fi xation times are 9 % shorter and 15 % fewer eye fi xations are needed to read the same information from an LCD versus a CRT.1,2 – Visual search error frequency is 22 % less when reading
Results 1  10
of
157