| Welcome to Crypto. We hope you enjoy your visit. You're currently viewing our forum as a guest. This means you are limited to certain areas of the board and there are some features you can't use. If you join our community, you'll be able to access member-only sections, and use many member-only features such as customizing your profile, sending personal messages, and voting in polls. Registration is simple, fast, and completely free. Join our community! If you're already a member please log in to your account to access all of our features: |
| Bit Dependancy | |
|---|---|
| Topic Started: Oct 18 2006, 02:51 PM (159 Views) | |
| loki | Oct 18 2006, 02:51 PM Post #1 |
|
Advanced Member
  ![]](http://209.85.122.85/static/1/pip_r.png)
|
Not sure if this has been done before, I tried searching and couldn't find anything like it. My question is would this be a reasonable method of encryption. take a 128 bit block and break down to 16 bytes. For each round X1 ^ X2 ^ X3....X16 ^ key X2 ^ X3 ^ X4....X1 ^ key The purpose was to see what would happen if I changed a bit or two from the output. I discovered that this is sorta like CBC and self recovers in if only 2-3 rounds, It took 12 rounds for compleate avalanche of every bit. I am testing something very simlier to this, just wondering if anyone knows a paper written on such a method. *** as a side note: Oddly enough for whatever reason, a sbox included in the round at the end or begginging. will not decrypt. |
| c(x) = 3x3 + x2 + x + 2; Find the inverse | |
 |
 
|
| 1 user reading this topic (1 Guest and 0 Anonymous) | |
| « Previous Topic · General · Next Topic » |
6:38 PM Nov 28
