Score:0

Discrete Logarithm Based algorithm

in flag

The private (secret) key in DL (discrete logarithm) based algorithms is uniformly selected from the group Zq*. This private key is then used to compute the public key. Could the opposite be done, for instance, select the public key uniformly from Zq* and then compute the private key?

DannyNiu avatar
vu flag
Only if you can solve the discrete logarithm problem. By the way, why did you tag this question with [tag:RSA]?
Leli avatar
in flag
Thanks for the feedback just removed the tag
meshcollider avatar
gb flag
Obviously if you could select a public key and then compute the private key from it, you would have broken all DLP-based cryptography. The entire point of asymmetric-key cryptography in general is that public key -> private key computation is hard.
Daniel S avatar
ru flag
It can be done in the case of [identifier-based cryptography](https://en.wikipedia.org/wiki/Identity-based_cryptography). In this case a central authority has a master secret that enables them to compute the private key for an arbitrary public key.
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.