2019-08-12 08:47 AM
The user manual (UM1924) says in section 15 RSA Algorithm:
There are two structures that pass keys to the functions:
•RSAprivKey_stt for the private key
•RSApubKey_stt for the public key
All members of the above functions should be filled by the user before calls to the RSA functions.
So I need the keys before using the library.
In the STM32_Cryptographic_example, in the RSA subfolder there's an example code that already comes with a pre-generated array for modulus, public and private exponents, message and signature, but how do you generate those arrays?
How do you generate the keys?
I know that modulus n=p*q and private exponent d=(e^-1)mod(Phi)... and all that, but I would think those formulas come already in the libraries and if not, how should one generate large p's and q's then?
Solved! Go to Solution.
2019-08-14 04:24 AM
You can use standard command line tools like openssl or use some kind of graphical tool like RSATool
2019-08-14 04:24 AM
You can use standard command line tools like openssl or use some kind of graphical tool like RSATool
2019-08-14 04:40 AM
Thank you!