Sciweavers

1898 search results - page 19 / 380
» Weak Keys for IDEA
Sort
View
SACRYPT
2009
Springer
212views Cryptology» more  SACRYPT 2009»
14 years 3 months ago
Compact McEliece Keys from Goppa Codes
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...
Rafael Misoczki, Paulo S. L. M. Barreto
SEC
1993
13 years 10 months ago
LUC: A New Public Key System
We describe public key cryptosystems and analyse the RSA cryptosystem, pointing out a weakness (already known) of the RSA system. We define Lucas functions and derive some of thei...
Peter J. Smith, Michael J. J. Lennon
ICICS
2004
Springer
14 years 2 months ago
On Some Weak Extensions of AES and BES
In 2002, Murphy and Robshaw introduced an extension BES of AES and argued this could compromise the security of AES. We introduce here two block-ciphers CES and Big-BES that are so...
Jean Monnerat, Serge Vaudenay
AAAI
1998
13 years 10 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
13 years 10 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...