Hi everybody,
for some wired idea I have I basically need to create a RSA keypair from
a given random seed (a MPI), and it should always output the same
keypair for the same seed. Ideally in a well-documented way in case
someone else needs to reimplement it.
Is that possible with libgcrypt? Is it even theoretically possible?
Thanks
Joachim
--
Joachim Breitner
e-Mail: mail@joachim-breitner.de | Homepage: http://www.joachim-breitner.de
JID: joachimbreitner@amessage.de | GPG-Keyid: 4743206C | ICQ#: 74513189
Geekcode: GCS/IT/S d-- s++:- a--- C++ UL+++ P+++ !E W+++ N-- !W O? M?>+ V?
PS++ PE PGP++ t? 5? X- R+ tv- b++ DI+ D+ G e+>* h! z?
Bitte senden Sie mir keine Word- oder PowerPoint-Anhänge.
Siehe http://www.fsf.org/philosophy/no-word-attachments.de.html
for some wired idea I have I basically need to create a RSA keypair from
a given random seed (a MPI), and it should always output the same
keypair for the same seed. Ideally in a well-documented way in case
someone else needs to reimplement it.
Is that possible with libgcrypt? Is it even theoretically possible?
Thanks
Joachim
--
Joachim Breitner
e-Mail: mail@joachim-breitner.de | Homepage: http://www.joachim-breitner.de
JID: joachimbreitner@amessage.de | GPG-Keyid: 4743206C | ICQ#: 74513189
Geekcode: GCS/IT/S d-- s++:- a--- C++ UL+++ P+++ !E W+++ N-- !W O? M?>+ V?
PS++ PE PGP++ t? 5? X- R+ tv- b++ DI+ D+ G e+>* h! z?
Bitte senden Sie mir keine Word- oder PowerPoint-Anhänge.
Siehe http://www.fsf.org/philosophy/no-word-attachments.de.html