Sciweavers

73 search results - page 4 / 15
» A Permutation Regularity Lemma
Sort
View
FSE
2006
Springer
101views Cryptology» more  FSE 2006»
13 years 9 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...
DAM
2007
79views more  DAM 2007»
13 years 5 months ago
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular...
Elizabeth Goode, Dennis Pixton
IJNSEC
2006
111views more  IJNSEC 2006»
13 years 5 months ago
Ideal Secret Sharing Schemes from Permutations
The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing. The restri...
Josef Pieprzyk, Xian-Mo Zhang
JSC
2010
132views more  JSC 2010»
13 years 4 months ago
Binary codes from the line graph of the n-cube
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
W. Fish, Jennifer D. Key, E. Mwambene
ICALP
2010
Springer
13 years 10 months ago
Pumping and Counting on the Regular Post Embedding Problem
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
Pierre Chambart, Philippe Schnoebelen