#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1996

2001

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Johan Borst, Lars R. Knudsen, Vincent Rijmen
- EUROCRYPT
- 1997

In cryptanalysis of block ciphers, there are several attacks that are always feasible and for which the success probability and complexity only depend on key length and/or block size. Exhaustive key search and table precomputation are two of such attacks. In Hel80] an attack was introduced which provides a tradeoo between the processing complexity of… (More)

- Johan Borst, Bart Preneel, Joos Vandewalle
- FSE
- 1999

In this paper we evaluate the resistance of the block cipher RC5 against linear cryptanalysis. We describe a known plaintext attack that can break RC5-32 (blocksize 64) with 10 rounds and RC5-64 (block-size 128) with 15 rounds. In order to do this we use techniques related to the use of multiple linear approximations. Furthermore the success of the attack… (More)

- Johan Borst, Bart Preneel, Vincent Rijmen
- Computer Networks
- 2001

The block cipher CRYPTON is a candidate proposal for the AES standard. In this report we describe a class of 232 weak keys. This is mainly a consequence of the use of linear operations in the key schedule. These weak keys especially have consequences for the use of CRYPTON in certain hash function constructions.

In this letter we show that the variation of the Cramer-Shoup public-key encryption scheme as introduced in 1] is not secure against an adaptive chosen ciphertext attack. This removes the putative main advantage of the scheme. Introduction: In 1] a new public-key encryption scheme was proposed. It is a (sim

- Johan Borst
- 1996

In this paper we describe an attack on 3 rounds of IDEA, making use of linear as well as diierential cryptanalytic techniques. The attack is independent of the key schedule. The main attack requires at most 2 29 chosen plaintext pairs and a workload of about 2 49 additions modulo 2 16 + 1 to nd two subkeys or their additive inverses modulo 2 16 + 1. Further… (More)

- ‹
- 1
- ›