ASIACRYPT
2003
Springer
13 years 11 months ago
2003
Springer
In this paper, we introduce a conceptually very simple and demonstrative algo
ASIACRYPT
2003
Springer
13 years 11 months ago
2003
Springer
We present an algorithm that finds polynomials with many roots modulo many primes by rotating candidate Number Field Sieve polynomials using the Chinese Remainder Theorem. We also...
ASIACRYPT
2003
Springer
13 years 11 months ago
2003
Springer
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
ASIACRYPT
2003
Springer
13 years 11 months ago
2003
Springer
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pair...
ASIACRYPT
2003
Springer
13 years 11 months ago
2003
Springer
We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). ...
ASIACRYPT
2003
Springer
13 years 11 months ago
2003
Springer
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a varian...
ASIACRYPT
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We study two closely related primitives: Broadcast Encryption and Key Predistribution Schemes (KPS). Broadcast Encryption allows a broadcaster to broadcast an encrypted m...
ASIACRYPT
2003
Springer
13 years 11 months ago
2003
Springer
In this paper1 we propose a new symmetric block cipher with the following paradoxical traceability properties: it is computationally easy to derive many equivalent secret keys prov...