Timeline for What problems might you encounter if you use a block size much greater than AES?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 4, 2018 at 12:00 | history | tweeted | twitter.com/StackCrypto/status/1069924402207297538 | ||
| Dec 4, 2018 at 9:51 | answer | added | hardyrama | timeline score: 3 | |
| Dec 4, 2018 at 6:48 | comment | added | lyrically wicked | Theoretically, MD6 compression function (described in Chapter 2.5 and Chapter 9 of the document “The MD6 hash function: A proposal to NIST for SHA-3”) is defined for any block size (assuming that the block size is a multiple of the word size). Since 1000 is divisible by 8, it would be possible to define this function for 1000-bit blocks. There are two serious problems though: 1) The number of rounds required to ensure the security is very big; 2) The algorithm relies on heuristic ways to choose optimal parameters for each block/word size. The second problem is what really annoys me. | |
| Dec 2, 2018 at 22:23 | answer | added | Maarten Bodewes♦ | timeline score: 4 | |
| Dec 2, 2018 at 22:05 | review | Low quality posts | |||
| Dec 2, 2018 at 22:35 | |||||
| Dec 2, 2018 at 21:57 | comment | added | kelalaka | Are there any such Cryptographic algorithm? If you have a secure one 1) Small messages will be very big. 2) key size will be big. 3) big,big big | |
| Dec 2, 2018 at 21:50 | review | First posts | |||
| Dec 3, 2018 at 8:12 | |||||
| Dec 2, 2018 at 21:49 | history | asked | user63954 | CC BY-SA 4.0 |