Sciweavers

2967 search results - page 175 / 594
» Cryptology
Sort
View
ASIACRYPT
2001
Springer
15 years 11 months ago
An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves
We present an algorithm for counting points on superelliptic curves yr = f(x) over a finite field Fq of small characteristic different from r. This is an extension of an algorit...
Pierrick Gaudry, Nicolas Gürel
ASIACRYPT
2001
Springer
15 years 11 months ago
On the Insecurity of a Server-Aided RSA Protocol
Abstract. At Crypto ’88, Matsumoto, Kato and Imai proposed a protocol, known as RSA-S1, in which a smart card computes an RSA signature, with the help of an untrusted powerful se...
Phong Q. Nguyen, Igor Shparlinski
ASIACRYPT
2001
Springer
15 years 11 months ago
Unbelievable Security. Matching AES Security Using Public Key Systems
The Advanced Encryption Standard (AES) provides three levels of security: 128, 192, and 256 bits. Given a desired level of security for the AES, this paper discusses matching publi...
Arjen K. Lenstra
CHES
2001
Springer
98views Cryptology» more  CHES 2001»
15 years 11 months ago
Attacks on Cryptoprocessor Transaction Sets
Attacks are presented on the IBM 4758 CCA and the Visa Security Module. Two new attack principles are demonstrated. Related key attacks use known or chosen differences between two...
Mike Bond
CHES
2001
Springer
191views Cryptology» more  CHES 2001»
15 years 11 months ago
A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware
Abstract. This work proposes a new elliptic curve processor architecture for the computation of point multiplication for curves defined over fields GF(p). This is a scalable arch...
Gerardo Orlando, Christof Paar