Sciweavers

10 search results - page 1 / 2
» asiacrypt 1999
Sort
View
ASIACRYPT
1999
Springer
14 years 3 months ago
On the Design of RSA with Short Secret Exponent
Hung-Min Sun, Wu-Chuan Yang, Chi-Sung Laih
ASIACRYPT
1999
Springer
14 years 3 months ago
Doing More with Fewer Bits
We present a variant of the Diffie-Hellman scheme in which the number of bits exchanged is one third of what is used in the classical Diffie-Hellman scheme, while the offered secu...
Andries E. Brouwer, Ruud Pellikaan, Eric R. Verheu...
ASIACRYPT
1999
Springer
14 years 3 months ago
Linear Complexity versus Pseudorandomness: On Beth and Dai's Result
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
Yongge Wang
ASIACRYPT
1999
Springer
14 years 3 months ago
Approximation Hardness and Secure Communication in Broadcast Channels
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
Yvo Desmedt, Yongge Wang
ASIACRYPT
1999
Springer
14 years 3 months ago
ECC: Do We Need to Count?
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
Jean-Sébastien Coron, Helena Handschuh, Dav...