I have a question from my teacher: "Why can a symmetric encryption algorithm be considered a pseudo-random number generation algorithm?
Can anyone explain it to me?
And sorry if my english is not good!
$\begingroup$
$\endgroup$
-
1$\begingroup$ In general, it can't. $\endgroup$ – Maeher Apr 7 at 14:05
-
$\begingroup$ Hint: what's the outcome of encrypting a moderate number of incremental values with a symmetric encryption algorithm (that has the same plaintext and ciphertext space, like a block cipher)? $\endgroup$ – fgrieu♦ Apr 7 at 14:05
-
$\begingroup$ is it the brute-force attack? $\endgroup$ – Thái Lại Quang Apr 7 at 14:16
-
$\begingroup$ What would happen if you would encrypt a stream of zero bits? How does the ciphertext behave? $\endgroup$ – Maarten Bodewes♦ Apr 7 at 22:53
-
$\begingroup$ Also would a symmetric encryption algorithm that securely encrypted a message and then appended 1kB of all-0 bytes still be a secure symmetric encryption scheme? $\endgroup$ – SEJPM♦ Apr 8 at 9:34
$\begingroup$
$\endgroup$
Here are two standard (and equivalent) definitions of confidentiality in symmetric encryption. If Alice sends Bob a message and Eve manages to see it in transit, Eve cannot (without an unreasonable amount of computation):
- Learn any fact about the plaintext other than possibly its length (semantic security);
- Tell the ciphertext apart from random data of the same length (ciphertext indistinguishability).
The latter criterion indirectly answers to your question. One way to implement a pseudorandom number generator is just to encrypt arbitrary inputs—say, encrypt the all zeroes string and use the ciphertexts as the pseudorandom output.
This also works in the opposite direction—if you have a secure pseudorandom generator, you can build a secure cipher out of it (called a stream cipher) by XORing its output with the messages. So in that sense, encrypting messages confidentially and generating secure pseudorandom numbers are equivalent problems.
answered Apr 9 at 17:47
$\begingroup$
$\endgroup$
Well, like the comments say, it can't. But maybe i can give you a hint, to what i may be related. Shanon worked on perfect security. One of his principes is, that the decrypt and encrypt text are stochatic stochatically independent. Some symmetric system (e.g. one time pad) are perfect secure.
I don't know the context of your teachers question, but this may give you an idea, where you can find an answer.
$\begingroup$
$\endgroup$
As you might know, a symmetric encryption algorithm is defined by a single key shared by two parties and the messages are encrypted and decrypted by this same key. We have two kinds of symmetric encryption algorithms: Stream Ciphers and Block Ciphers.
A Stream Cipher works as a Pseudo Random Number Generator (PRNG), then uses the generated number to perform a XOR with your plaintext to get the ciphertext.
So you can use any Stream Cipher as a PRNG by using your plaintext as the seed, then encrypting sucessivelly the result of the encryption during the generation process. You can also perform this using Block Ciphers, but they are much slower than Stream Ciphers.
In 2019 I developped an algorithm which uses a Stream Cipher, Salsa20, as a CSPRNG. https://github.com/mafone/RKHC.
