Sciweavers

1763 search results - page 267 / 353
» Dependent random choice
Sort
View
ASIACRYPT
2007
Springer
15 years 10 months ago
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
Jacques Patarin, Valérie Nachef, Côme...
142
Voted
ATAL
2007
Springer
15 years 10 months ago
Emergence of global network property based on multi-agent voting model
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
Kousuke Shinoda, Yutaka Matsuo, Hideyuki Nakashima
FC
2007
Springer
141views Cryptology» more  FC 2007»
15 years 10 months ago
The Unbearable Lightness of PIN Cracking
Responding to the PIN cracking attacks from Berkman and Ostrovsky (FC 2007), we outline a simple solution called salted-PIN. A randomly generated salt value of adequate length (e.g...
Omer Berkman, Odelia Moshe Ostrovsky
GECCO
2007
Springer
230views Optimization» more  GECCO 2007»
15 years 10 months ago
Activation energy-based simulation for self-assembly of multi-shape tiles
Building artificial systems using self-assembly is one of the main issues of artificial life [17]. Scientists are trying to understand this process either using experimental appro...
Mostafa Mostafa Hashim Ellabaan
MFCS
2007
Springer
15 years 10 months ago
Evolvability
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
Leslie G. Valiant