Sciweavers

CALC
2001
Springer
171views Cryptology» more  CALC 2001»
14 years 1 months ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham
CALC
2001
Springer
145views Cryptology» more  CALC 2001»
14 years 1 months ago
Fast Reduction of Ternary Quadratic Forms
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
Friedrich Eisenbrand, Günter Rote
CALC
2001
Springer
201views Cryptology» more  CALC 2001»
14 years 1 months ago
Finding Small Solutions to Small Degree Polynomials
Abstract. This talk is a brief survey of recent results and ideas concerning the problem of finding a small root of a univariate polynomial mod N, and the companion problem of fi...
Don Coppersmith
ASIACRYPT
2001
Springer
14 years 1 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
14 years 1 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
14 years 1 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
14 years 1 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
14 years 1 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
14 years 1 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...