You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi, I was wondering if there is any theoretical background to this?
I'm doing something similar except I'm getting the seed entropy from user input and doing modular multiplication on that. Is there some kind of theoretical basis to this?
I use this basic randomness to compile RSA keys.
The text was updated successfully, but these errors were encountered:
JoshZeidner
changed the title
Theory behind modular
Theory behind modular multiplication entropy production
Nov 4, 2017
Hi,
I did my best to explain it in the Crowd Supply campaign. Have a look at the "How it works - Hardware" section if you like.
Not so sure if this is equivalent to your implementation.
I can't recommend implementing modular entropy multiplication purely in software, as it could perform too "perfect" - resulting in almost no entropy being introduced by it.
But still you should have correlating adjacent bits, so you could also implement health monitoring. (and measure the actual entropy)
Most probably all you rely on is the entropy from the user input.
Hi, I was wondering if there is any theoretical background to this?
I'm doing something similar except I'm getting the seed entropy from user input and doing modular multiplication on that. Is there some kind of theoretical basis to this?
I use this basic randomness to compile RSA keys.
The text was updated successfully, but these errors were encountered: