nah it's just off the top of my head lol

Are you maybe also familiar with crc? @MickLH

I think that we can also find the roundng function using this method

Or not?

@e-sushi if anybody needs context for that one: meta.crypto.stackexchange.com/q/823/23623

NSA might be decrypting much TLS traffic by making stats of which 2 prime numbers are mostly used and brute forcing each until they decrypt it

how many times your browser picks up the same prime numbers for diffie hellman key exchange

@defalt while the NSA may haven broken common 1024-bit DH primes, I strongly doubt they broke 2048-primes which are very common these days

@SEJPM Are you maybe familiar with crc?

@Evinda only on a basic level

Ah did you see my question?

@Evinda yes

Do you have an idea?

@Evinda not really

Ok

@Evinda Honestly, after reading your question twice, I still have absolutely no idea what you are asking... Are you trying to make a Feistel cipher from CRCs? Are you trying to attack a Feistel cipher using CRCs? How did you get the idea that CRCs have anything to do with encryption in the first place? Some context would probably improve that question a lot.

@Evinda I could use some clarification as well

@MickLH @yyyyyyy Sorry, I was confused

Could we maybe also use s-boxes?