61 search results - page 5 / 13 » Arbitrary Bit Permutations in One or Two Cycles |
110
click to vote
FSE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...
121
click to vote
ISCAS
2008
IEEE
15 years 9 months ago
2008
IEEE
— A low energy modulo-multiplier is proposed for elliptic curve cryptography (ECC) processor, especially for authentication in mobile device or key encryption in embedded health-...
146
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
132
Voted
FCT
2009
Springer
15 years 9 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
138
click to vote
APPT
2009
Springer
15 years 10 months ago
2009
Springer
SIMD extension is one of the most common and effective technique to exploit data-level parallelism in today’s processor designs. However, the performance of SIMD architectures i...