Skip to main content
14 events
when toggle format what by license comment
Oct 7, 2021 at 7:34 history edited CommunityBot
replaced https://tools.ietf.org/html/rfc with https://www.rfc-editor.org/rfc/rfc
Jun 19, 2017 at 15:48 vote accept Jay
Jun 19, 2017 at 15:48 vote accept Jay
Jun 19, 2017 at 15:48
Jun 19, 2017 at 15:48 vote accept Jay
Jun 19, 2017 at 15:48
Jun 19, 2017 at 14:12 history tweeted twitter.com/StackCrypto/status/876804803665506308
Jun 19, 2017 at 13:38 comment added Thomas M. DuBuisson I suggest you read the Fortuna paper and following works. It speaks to your situation quite well.
Jun 19, 2017 at 11:36 answer added Paul Uszak timeline score: 5
Jun 19, 2017 at 11:09 answer added Maarten Bodewes timeline score: 10
Jun 19, 2017 at 10:43 comment added Jay 1. By source generating secrets I mean I have a shared randomness between two parties which is quantized to generate secret string of $1's & 0's$, 8-10 bits per sec. 2. I am using this secret string to drive PRNG. Since there is a minimum requirement of length of PRNG and I cannot use same seed for each time to drive PRNG I planned to use hashed values in each turn. So dilema is whether to give longer bit stream to hash or give short string each time.
Jun 19, 2017 at 10:19 comment added Maarten Bodewes What do you mean that your source generates secrets? Do you possibly mean entropy as input for a PRNG / DRBG, i.e. random number generator? In that case, why not use a DRBG algorithm instead of HKDF? Those have specific methods to update the entropy. Secret bits are bits that you tend to distribute and store so that you can reuse them, e.g. as key for a symmetric cipher.
Jun 19, 2017 at 10:11 history edited otus
More accurate tags
Jun 19, 2017 at 10:04 history edited Jay CC BY-SA 3.0
added 4 characters in body
Jun 19, 2017 at 9:58 history edited Jay CC BY-SA 3.0
added 85 characters in body
Jun 19, 2017 at 9:52 history asked Jay CC BY-SA 3.0