0

I m actually studying Turing works concerning Enigma's machine.

Actually, I am wondering if it does exist anything, an algorithm or something that allows people to tlel if an algorithm can be break or not.

For example, admitting that we're working on the AES cryptographic cypher, how can we know that we can reverse the code ?

How are they different from hash algorithm ?

mfrachet
  • 101
  • Conceptually, if it wasn't reversible, it would be a pretty terrible code, because it couldn't be used to transmit information in the first place. – Ben Sheller Oct 15 '15 at 20:55
  • Yes but does it exist a way to, mathematically, determine if the algorithm can be solved without using the reverse code directly ? Just to know : "Can I reverse it ?" yes / no . Like how can we say that hash algorithm cannot be reverse ? What can tell it ? – mfrachet Oct 15 '15 at 21:10

0 Answers0