# Re: Weakness of Feistel ciphers

*From*: kim@xxxxxxxxxxx (Kim G. S. Øyhus)*Date*: Wed, 19 Apr 2006 20:38:06 +0000 (UTC)

In article <7xodyx74on.fsf@xxxxxxxxxxxxxxxxxxx>,

Paul Rubin <http://phr.cx@xxxxxxxxxxxxxx> wrote:

kim@xxxxxxxxxxx (Kim G. S. Øyhus) writes:

It has to work modula a Mersenne prime, product of primes, or similar.

OK. It sounds like you're asking for a bijection from Z//p to Z//p

where you can quickly compute both the encryption and its inverse. Is

that right?

Yes, and perhaps other fields or semigroups as well, as you guessed.

That is straightforward to do using AES or SHA or whatever as a

building block. Schroeppel's paper about the Hasty Pudding Cipher

explains how.

Thank you for your advice. I will examine that.

I am not a rookie. I have worked professionally with crypto for over

4 years now, and have made stuff like the fastest RSA for the ARM

processor, and a system which converts fingerprints to crypto keys.

The kinds of questions you're asking make it sound like you may

understand how to implement math algorithms, but you don't actually

understand crypto. There's nothing wrong with that, but it means

you're not yet in a position to roll your own.

Since I do not need strong crypto, I think it is perfectly all right

to make my own. I just need something that is strong enough, stronger

than ordinary pseudo random generators. My tests say I have achieved

that, but they can be wrong.

Kim0

.

**Follow-Ups**:**Re: Weakness of Feistel ciphers***From:*Unruh

**Re: Weakness of Feistel ciphers***From:*Paul Rubin

**References**:**Weakness of Feistel ciphers***From:*Kim G. S. Øyhus

**Re: Weakness of Feistel ciphers***From:*Jean-Luc Cooke

**Re: Weakness of Feistel ciphers***From:*Kim G. S. Øyhus

**Re: Weakness of Feistel ciphers***From:*Paul Rubin

- Prev by Date:
**Re: Weakness of Feistel ciphers** - Next by Date:
**Re: Weakness of Feistel ciphers** - Previous by thread:
**Re: Weakness of Feistel ciphers** - Next by thread:
**Re: Weakness of Feistel ciphers** - Index(es):