New answers tagged

0

Ease of memorization and cryptographically secure password criteria manifestly contradict each other by their respective definitions. In fact, we can show that the information-theoreticall measure of password strength is equivalent to entropy. What is Entropy Again? Remember that Shannon Entropy is the information content of a discrete variable X - that ...


-3

It seems like good idea. I use a code like this: head -c 2048 /dev/urandom |sha512sum |grep -oP '\d{1,2}' |tr -d "\n" |md5sum |awk '{print substr($0,0,8)}' Explanation: head -c 2048 - print 2048 bytes of data; /dev/urandom - pseudo-device generated pseudo-random bits; sha512sum - create sha256 check sum; grep -oP '\d{1,2}' - take 1-2 long char digit ...


4

First off: Those commands are not sloppily thrown together. They are stiched together such that they do the job. And yes, of course they do their job. Hashing 16 bytes of entropy, expanding it to a longer (but printable) string, should be fine from a security perspective. The definition of secure might be different for you, though. Usually, secure ...



Top 50 recent answers are included