Sciweavers

74 search results - page 3 / 15
» How Good is Almost Perfect
Sort
View
CTRSA
2006
Springer
104views Cryptology» more  CTRSA 2006»
13 years 11 months ago
A New Criterion for Nonlinearity of Block Ciphers
For years, the cryptographic community has searched for good nonlinear functions. Bent functions, almost perfect nonlinear functions, and similar constructions have been suggested ...
Orr Dunkelman, Nathan Keller
SPIRE
2005
Springer
14 years 1 months ago
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups
Large inverted indices are by now common in the construction of web-scale search engines. For faster access, inverted indices are indexed internally so that it is possible to skip...
Paolo Boldi, Sebastiano Vigna
AAAI
2010
13 years 9 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...
INFOCOM
2010
IEEE
13 years 6 months ago
How do Superpeer Networks Emerge?
—In this paper, we develop an analytical framework which explains the emergence of superpeer networks on execution of the commercial peer-to-peer bootstrapping protocols by incom...
Bivas Mitra, Abhishek Kumar Dubey, Sujoy Ghose, Ni...
ICITS
2009
13 years 5 months ago
Cryptanalysis of Secure Message Transmission Protocols with Feedback
In the context of secure point-to-point message transmission in networks with minimal connectivity, previous studies showed that feedbacks from the receiver to the sender can be us...
Qiushi Yang, Yvo Desmedt