Sciweavers

9 search results - page 1 / 2
» indocrypt 2003
Sort
View
INDOCRYPT
2003
Springer
13 years 9 months ago
Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both propos...
P. J. Abisha, D. G. Thomas, K. G. Subramanian
INDOCRYPT
2003
Springer
13 years 9 months ago
Analysis of Non-fortuitous Predictive States of the RC4 Keystream Generator
The RC4 stream cipher is the most widely used software based stream cipher. It is based on a secret internal state of N = 256 bytes and two pointers. This paper proposes an efficie...
Souradyuti Paul, Bart Preneel
INDOCRYPT
2003
Springer
13 years 9 months ago
Stronger Security Bounds for OMAC, TMAC, and XCBC
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
Tetsu Iwata, Kaoru Kurosawa
INDOCRYPT
2003
Springer
13 years 9 months ago
On the Construction of Prime Order Elliptic Curves
We consider a variant of the Complex Multiplication (CM) method for constructing elliptic curves (ECs) of prime order with additional security properties. Our variant uses Weber po...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
INDOCRYPT
2003
Springer
13 years 9 months ago
Practical Mental Poker Without a TTP Based on Homomorphic Encryption
A solution for obtaining impartial random values in on-line gambling is presented in this paper. Unlike most previous proposals, our method does not require any TTP and allows e-ga...
Jordi Castellà-Roca, Josep Domingo-Ferrer, ...