How to generate primitive root modulo n using OpenSSL?

Asked May 07 '19 at 18:09

Active May 07 '19 at 18:09

Viewed 199 times

I need to generate primitive root modulo n for ElGamal cryptosystem, where n - is big prime number. How can I generate it using OpenSSL?

Is there special function like primitive_root(...)? I didn't found enything like this.

asked May 07 '19 at 18:09

Nabla

I did not find any such function in my perusal. – President James K. Polk May 08 '19 at 01:06
You can use [NTL](https://www.shoup.net/ntl/) library, [here](https://saadquader.wordpress.com/2017/08/25/finding-primitive-roots-of-unity-in-a-finite-field-c-code-using-ntl/) example. – kelalaka May 08 '19 at 07:31
There is `BN_mod_sqrt` which takes the *square* root, but I guess that's not what you are looking for. – Maarten Bodewes May 08 '19 at 17:10

0 Answers0