# Tag Info

3

I have considered your requirements to be these: it should be a function passphrase is so weak, that if hash of it is known (or big part of hash), then it can be brute forced. many passwords can be generated as output. There exists various kinds of key derivation functions, which derive cryptographic keys from other cryptographic keys or passwords. The ...

0

Here is another very simple scheme (not fully secure but it should be enough for your needs). Chose a strong password $pwd$. Let's say you want a password for the website $xyz$. Compute: $PWD = \text{AES}(pwd,xyz)$ where $pwd$ is the key for your encryption. $PWD$ can then be used as a password to access to the $xyz$ website. Should you want to have ...

3

You can just use a counter along with a key derivation function (https://en.wikipedia.org/wiki/Key_derivation_function) such as a hash, and do something such as: for(int i = 0; i < numberOfPasswordsToGenerate; i++){ aNewPassword = hash(MyWeakPassphrase + i); } The counter makes sure you get a new password, for each iteration of the loop, and they ...

0

That at least does not contradict "the definition of PAKE that supports" sets $PW$ which are known, since the adversary can just try an element of $PW\hspace{-0.03 in}$. ​ However, that does not give meaningful assurance against, for example adversaries who have information which uniquely determines the password without letting the adversary find the ...

1

This looks like a (homework) assignment as the parameters are artificially small and the method is highly unconventional as opposed to the standard "You want the attacker to do more work?" - "Just increase the work parameter!". Because of this I'll give you some hints on how to solve this. Increase the size of the salt from 12 bits to 24 bits. You ...

0

Given the diagram, yes they are randomly selected keys, $P$ is a fixed plaintext and the projection of the output to the keyspace gives you the next input as key to the cipher, thus creating a pseudorandom walk through the keyspace.

Top 50 recent answers are included