Sciweavers

6 search results - page 1 / 2
» Pseudorandom Permutation Families over Abelian Groups
Sort
View
FSE
2006
Springer
101views Cryptology» more  FSE 2006»
13 years 11 months ago
Pseudorandom Permutation Families over Abelian Groups
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized different...
Louis Granboulan, Éric Levieil, Gilles Pire...
RSA
2008
89views more  RSA 2008»
13 years 7 months ago
Simple permutations mix even better
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
Alex Brodsky, Shlomo Hoory
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 8 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
WDAG
2009
Springer
114views Algorithms» more  WDAG 2009»
14 years 2 months ago
Virtual Ring Routing Trends
Virtual Ring Routing (VRR) schemes were introduced in the context of wireless ad hoc networks and Internet anycast overlays. They build a network-routing layer using ideas from dis...
Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renat...
IEICET
2006
108views more  IEICET 2006»
13 years 7 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki