Sciweavers

1769 search results - page 163 / 354
» Cryptography
Sort
View
116
Voted
IMA
2009
Springer
113views Cryptology» more  IMA 2009»
15 years 10 months ago
On Linear Cryptanalysis with Many Linear Approximations
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
Benoît Gérard, Jean-Pierre Tillich
IMA
2009
Springer
124views Cryptology» more  IMA 2009»
15 years 10 months ago
Comparing with RSA
A multi-set (ms) is a set where an element can occur more than once. ms hash functions (mshfs) map mss of arbitrary cardinality to fixed-length strings. This paper introduces a ne...
Julien Cathalo, David Naccache, Jean-Jacques Quisq...
IWSEC
2009
Springer
15 years 10 months ago
Reducing Complexity Assumptions for Oblivious Transfer
Reducing the minimum assumptions needed to construct various cryptographic primitives is an important and interesting task in theoretical cryptography. Oblivious Transfer, one of ...
K. Y. Cheong, Takeshi Koshiba
122
Voted
POLICY
2009
Springer
15 years 10 months ago
Security Policy Implementation Strategies for Common Carrier Monitoring Service Providers
—There are increasing capabilities and demands for the remote monitoring of homes and their occupants. There are a variety of options for the architecture of such monitoring syst...
Carl A. Gunter
155
Voted
SACRYPT
2009
Springer
212views Cryptology» more  SACRYPT 2009»
15 years 10 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