17 search results - page 2 / 4 » Security of Random Feistel Schemes with 5 or More Rounds |
TCC
2010
Springer
14 years 1 months ago
2010
Springer
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
CRYPTO
2010
Springer
13 years 2 months ago
2010
Springer
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
ISCAS
2008
IEEE
13 years 11 months ago
2008
IEEE
— Recently four chaos-based image encryption schemes were proposed. Essentially, the four schemes can be classified into one class, which is composed of two basic parts: permuta...
DCC
2005
IEEE
14 years 4 months ago
2005
IEEE
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...