Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

I am 14 years and am a NN/ML CS enthusiast (perhaps some of you have seen my NN troubles on SO). I have this question: is it computationally plausible to use NN/ML to do any of the following tasks? (I have a vague idea of how to program these)

  1. "Real" cryptanalysis. Cyclic neural networks for extended computation, but break the hash all the way through.

  2. Estimating the entropy of the plaintext from the ciphertext.

  3. Any other cryptanalysis tricks or procedures.

share|improve this question

migrated from cstheory.stackexchange.com Feb 15 at 0:12

This question came from our site for theoretical computer scientists and researchers in related fields.

2  
My advice would be to stick to one question per question. Here you have 3 separate question, all concatenated into the same question box. That isn't a good fit for this site; a good question should have a single answer. (Actually, the 3rd one -- "any other tricks..." -- is also not a good fit, as it is too unfocused.) Also, we expect you to do some research on your own and tell us what you've tried; I don't see that in the question at present. Finally, I suggest starting from the goal (drive in a nail) and ask for a solution, rather than starting with a hammer and looking for nails. –  D.W. Feb 16 at 2:18
add comment

2 Answers 2

up vote 5 down vote accepted

To answer point 2: No.

When using a good encryption scheme, one aims to prove that the ciphertext is only negligibly different from random data. As such, without breaking the encryption scheme completely no information (for example the entropy) of the plaintext is leaked.

share|improve this answer
add comment

NN/ML is pretty useless for cryptanalysis, but surprisingly useful for building cryptosystems. It turns out that you can build a trapdoor permutation on the assumption that learning (in an ML sense) certain classes of functions is computationally hard. An example of this is Regev's seminal paper on lattices and the learning-with-errors assumption.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.