Sciweavers

ASIACRYPT
2001
Springer
13 years 9 months ago
Speeding Up XTR
This paper describes several speedups and simplifications for XTR. The most important results are new XTR double and single exponentiation methods where the latter requires a chea...
Martijn Stam, Arjen K. Lenstra
ASIACRYPT
2001
Springer
13 years 9 months ago
A Compact Rijndael Hardware Architecture with S-Box Optimization
Compact and high-speed hardware architectures and logic optimization methods for the AES algorithm Rijndael are described. Encryption and decryption data paths are combined and all...
Akashi Satoh, Sumio Morioka, Kohji Takano, Seiji M...
ASIACRYPT
2001
Springer
13 years 9 months ago
How to Leak a Secret
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signatu...
Ronald L. Rivest, Adi Shamir, Yael Tauman
ASIACRYPT
2001
Springer
13 years 9 months ago
Generic Attacks on Feistel Schemes
Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A:
Jacques Patarin
ASIACRYPT
2001
Springer
13 years 9 months ago
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
Threshold cryptosystems and signature schemes give ways to distribute trust throughout a group and increase the availability of cryptographic systems. A standard approach in design...
Anna Lysyanskaya, Chris Peikert
ASIACRYPT
2001
Springer
13 years 9 months ago
Mutually Independent Commitments
We study the two-party commitment problem, where two players have secret values they wish to commit to each other. Traditional commitment schemes cannot be used here because they d...
Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leo...
ASIACRYPT
2001
Springer
13 years 9 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
ASIACRYPT
2001
Springer
13 years 9 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
13 years 9 months ago
Known-IV Attacks on Triple Modes of Operation of Block Ciphers
With chosen-IV chosen texts, David Wagner has analyzed the multiple modes of operation proposed by Eli Biham in FSE’98. However, his method is too unrealistic. We use only known-...
Deukjo Hong, Jaechul Sung, Seokhie Hong, Wonil Lee...
ASIACRYPT
2001
Springer
13 years 9 months ago
Practical Construction and Analysis of Pseudo-Randomness Primitives
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...
Johan Håstad, Mats Näslund