Generation of the primes p, q and g for DSA using an Hash Function in OpenSSL

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



On 26/11/2015 11:25, Mofassir Ul Haque wrote:
> We can generate primes p,q and g for DSA in OpenSSL by using command:
>
> openssl dsaparam -text -out dsaparam.pem 1024
>
> Is it possible to generate primes p , q and g using an Hash Function 
> in OpenSSL if value of L , N and hash function is known ?
>
> Any help will be greatly appreciated !
One solution (if all else fails) is to implement the
calculations direcly using the bigint functions in
version 1.0.2 and older of OpenSSL.

This has worked very well for me in code that didn't
need FIPS certification.


Enjoy

Jakob
-- 
Jakob Bohm, CIO, Partner, WiseMo A/S.  https://www.wisemo.com
Transformervej 29, 2860 S?borg, Denmark.  Direct +45 31 13 16 10
This public discussion message is non-binding and may contain errors.
WiseMo - Remote Service Management for PCs, Phones and Embedded



[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Index of Archives]     [Linux ARM Kernel]     [Linux ARM]     [Linux Omap]     [Fedora ARM]     [IETF Annouce]     [Security]     [Bugtraq]     [Linux]     [Linux OMAP]     [Linux MIPS]     [ECOS]     [Asterisk Internet PBX]     [Linux API]

  Powered by Linux