Score:1

How can a generate a key with defined key size with a hash function with its security/internal state shorter than the key?

pf flag

Let's suppose I took a high resolution photo full of entropy and I want to convert in a key with 2048-bits of security.

Practically all the known hash algorithms have maximum 512-bits of security.

Is there a mode/scheme to generate a 2048-bit key with a hash function with its internal state/security of 512-bits (or 256-bits maybe)?

us flag
`convert in a key 2048-bits of security` why? what do you want to achieve?
Paul Uszak avatar
cn flag
This is really really easy, but I have to walk the dog. More later... (Hint: randomness extraction). See [Photonic Instrument](http://www.reallyreallyrandom.com/photonic/) write-up. It's exactly what you're doing.
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.