517 search results - page 48 / 104 » Bit Encryption Is Complete |
EUROCRYPT
2001
Springer
14 years 14 days ago
2001
Springer
In this paper we consider the security of block ciphers which contain alternate layers of invertible S-boxes and affine mappings (there are many popular cryptosystems which use thi...
MST
2010
13 years 6 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
CHES
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. In this paper we propose a new family of very efficient hardware oriented block ciphers. The family contains six block ciphers divided into two flavors. All block ciphers...
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We introduce a compact and efficient representation of elements of the algebraic torus. This allows us to design a new discretelog based public-key system achieving the o...
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...