Tag Info

New answers tagged

0

A PRNG is basically a really slow stream cipher; the random data can be thought of as a key stream. So what you just did is defining a stream cipher using whatever primitives the PRNG is based on. Adding an additional hashing method - basically another deterministic algorithm - doesn't do much if the PRNG is strong; the PRNG may even be used by the PRNG ...


0

This question is not really well defined. If by "Would this actually work?" you mean "Will this be as good as using a one time pad of length y" then the short answer is No. Anything susceptible to a brute force attack is not as secure as a one time pad. What are you trying to achieve? If you already agreed on a key of 512 bits and assume this is the ...


1

This looks like part of a problem posted from the first week's assignment of the Cryptography 1 Coursera course. Boneh outlines in his course material how XOR'ing two cipher texts encrypted with the same key result in a new cipher, similar to below. $$ m_1 \oplus k = c_1 \\ m_2 \oplus k = c_2 \\ c_1 \oplus c_2 = m_1 \oplus k \oplus m_2 \oplus k = m_1 ...



Top 50 recent answers are included