Sciweavers

8 search results - page 1 / 2
» A New Algorithm for Finding Minimum-Weight Words in Large Li...
Sort
View
IMA
1995
Springer
97views Cryptology» more  IMA 1995»
13 years 9 months ago
A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
Anne Canteaut
JSC
2006
147views more  JSC 2006»
13 years 5 months ago
An algorithm to solve integer linear systems exactly using numerical methods
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
Zhendong Wan
DCC
2009
IEEE
14 years 6 months ago
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources
We present a new lossy compressor for discrete sources. For coding a source sequence xn , the encoder starts by assigning a certain cost to each reconstruction sequence. It then f...
Shirin Jalali, Andrea Montanari, Tsachy Weissman
CN
2008
117views more  CN 2008»
13 years 5 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
EUROCRYPT
2009
Springer
14 years 6 months ago
Smashing SQUASH-0
At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol...
Khaled Ouafi, Serge Vaudenay