Results 1  10
of
1,051
Generic Attacks and the Security of Quartz
 PKC 2003, LNCS V. 2567
, 2001
"... Abstract. The signature scheme Quartz is based on a trapdoor function G belonging to a family called HFEv. It has two independent security parameters, and we claim that if d is big enough, no better method to compute an inverse of G than the exhaustive search is known. Such a (quite strong) assumpt ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
) assumption, allows to view Quartz as a general construction, that transforms a trapdoor function into a short signature scheme. The main object of this paper is the concrete security of this construction. On one hand, we present generic attacks on such schemes. On the other hand, we study the possibility
Generic Attacks on Feistel Schemes
 Advances in Cryptology – ASIACRYPT 2001
, 2001
"... Abstract. Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A: 1. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2 7n 4) computations with O(2 7n 4) random plaintext/cipher ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
/ciphertext pairs. 2. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2 3n 2) computations with O(2 3n 2) chosen plaintexts. Since the complexities are smaller than the number 2 2n of possible inputs, they show that some generic attacks always exist on Feistel
A New Proposal Against the Main of Generic Attacks
"... Abstract.This paper presents a efficient proposal for iterating hash functions to prevent the main of generic attacks such as Multicollisions Attack,Second Preimage Attack and Herding Attack.Based on this proposal,it’s possible that a secure hash function can be built with iterating compression func ..."
Abstract
 Add to MetaCart
Abstract.This paper presents a efficient proposal for iterating hash functions to prevent the main of generic attacks such as Multicollisions Attack,Second Preimage Attack and Herding Attack.Based on this proposal,it’s possible that a secure hash function can be built with iterating compression
Generic Attacks on Misty Schemes5 rounds is not enough
"... Abstract. Misty schemes are classic cryptographic schemes used to construct pseudorandom permutations from 2n bits to 2n bits by using d pseudorandom permutations from n bits to n bits. These d permutations will be called the “internal ” permutations, and d is the number of rounds of the Misty sch ..."
Abstract
 Add to MetaCart
scheme. Misty schemes are important from a practical point of view since for example, the Kasumi algorithm based on Misty schemes has been adopted as the standard blockcipher in the third generation mobile systems. In this paper we describe the best known “generic ” attacks on Misty schemes, i.e. attacks
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
 ASIACRYPT'07
, 2007
"... Unbalanced Feistel schemes with expanding functions are used to construct pseudorandom permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bits. At each round, all the bits except n bits are changed by using a function that depends only on these n bits. C.S.Jutla ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
.S.Jutla. We also give precise formulas for the complexity of our attacks in d, k and n. Key words: Unbalanced Feistel permutations, pseudorandom permutations, generic attacks on encryption schemes, Block ciphers.
Generic attacks on Alternating Unbalanced Feistel Schemes
"... Abstract. Generic attacks against classical (balanced) Feistel schemes, unbalanced Feistel schemes with contracting functions and unbalanced Feistel schemes with expanding functions have been studied in [12], [4], [15], [16]. In this paper we study schemes where we use alternatively contracting rand ..."
Abstract
 Add to MetaCart
Abstract. Generic attacks against classical (balanced) Feistel schemes, unbalanced Feistel schemes with contracting functions and unbalanced Feistel schemes with expanding functions have been studied in [12], [4], [15], [16]. In this paper we study schemes where we use alternatively contracting
Building Secure Block Ciphers on Generic Attacks Assumptions
"... Abstract. Up to now, the design of block ciphers has been mainly driven by heuristic arguments, and little theory is known to constitute a good guideline for the development of their architecture. Trying to remedy this situation, we introduce a new type of design for symmetric cryptographic primitiv ..."
Abstract
 Add to MetaCart
(though significant) range of attacks. Our construction strategy leads to a large expanded key size, though still usable in practice (around 1 MB). Key words: block ciphers, Feistel schemes, generic attacks, provable security 1
Generic Attacks on Feistel Schemes  Extended Version
 IACR EPRINT
, 2008
"... Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A: 1. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2^n) computations with O(2^n) nonadaptive chosen plaintexts. 2. It ..."
Abstract
 Add to MetaCart
. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2^(3n/2)) computations with O(2^(3n/2)) random plaintext/ciphertext pairs. Since the complexities are smaller than the number 2^2n of possible inputs, they show that some generic attacks always exist
Generic Attacks on Feistel SchemesExtended Version
"... Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A: 1. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2n) computations with O(2n) nonadaptive chosen plaintexts. 2. It is ..."
Abstract
 Add to MetaCart
. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2 3n2) computations with O(2 3n2) random plaintext/ciphertext pairs. Since the complexities are smaller than the number 22n of possible inputs, they show that some generic attacks always exist on Feistel
Results 1  10
of
1,051