Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Theory behind modular multiplication entropy production #33

Open
JoshZeidner opened this issue Nov 4, 2017 · 1 comment
Open

Theory behind modular multiplication entropy production #33

JoshZeidner opened this issue Nov 4, 2017 · 1 comment

Comments

@JoshZeidner
Copy link

JoshZeidner commented Nov 4, 2017

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.

@JoshZeidner JoshZeidner changed the title Theory behind modular Theory behind modular multiplication entropy production Nov 4, 2017
@manuel-domke
Copy link
Collaborator

manuel-domke commented Apr 10, 2018

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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants