Implementaton of Maurer's algorithm of provable primes generation (with RSA etc.)

Sep 11, 2014 2 Replies
Implementaton of Maurer's algorithm of provable primes generation (with RSA etc.) open original image

I have implemented Maurer's algorithm of provable primes generation in Python:

formatting link
(with illustrative coding of RSA encryption (with authentication) and digital signature for sequences of fixed-sized plaintext blocks)



For comments and critiques I should be very grateful.



M. K. Shen


PROVABLEPRIME Versison 1.0.1 has been released. It contains a few additional functions to write to and read from files as convenience utilities for the illustrative examples. (There are 4 illustrative examples: prime generation, RSA key generation, RSA block encryption and RSA digital signature.)

M. K. Shen

A new Version 1.1 of PROVABLEPRIME has just been released. It now has the following five illustrative examples:

Generation of a pseudo-random provable prime of desired size.

Generation of RSA keys (satisfying certain desirable constraints).

RSA block encryption procesing.

RSA digital signature processing.

RSA pseudo-random bit generation.

M. K. Shen

Join the Discussion

Have something to add? Share your thoughts — no account required.

Didn't find your answer?

Ask the community — no account required