Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.programming > #4743 > unrolled thread

A code of Maurer's algorithm of provable primes generation

Started byMok-Kong Shen <mok-kong.shen@t-online.de>
First post2014-09-04 09:33 +0200
Last post2014-10-10 23:49 +0200
Articles 3 — 1 participant

Back to article view | Back to comp.programming


Contents

  A code of Maurer's algorithm of provable primes generation Mok-Kong Shen <mok-kong.shen@t-online.de> - 2014-09-04 09:33 +0200
    Re: A code of Maurer's algorithm of provable primes generation Mok-Kong Shen <mok-kong.shen@t-online.de> - 2014-09-19 14:25 +0200
    Re: A code of Maurer's algorithm of provable primes generation Mok-Kong Shen <mok-kong.shen@t-online.de> - 2014-10-10 23:49 +0200

#4743 — A code of Maurer's algorithm of provable primes generation

FromMok-Kong Shen <mok-kong.shen@t-online.de>
Date2014-09-04 09:33 +0200
SubjectA code of Maurer's algorithm of provable primes generation
Message-ID<lu94jq$5jg$2@news.albasani.net>
I have implemented Maurer's algorithm of provable primes generation
in Python: http://s13.zetaboards.com/Crypto/topic/7234475/1/

For comments and critiques I should be very grateful.

M. K. Shen

[toc] | [next] | [standalone]


#4801

FromMok-Kong Shen <mok-kong.shen@t-online.de>
Date2014-09-19 14:25 +0200
Message-ID<lvh7b0$8pi$2@news.albasani.net>
In reply to#4743
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

[toc] | [prev] | [next] | [standalone]


#4825

FromMok-Kong Shen <mok-kong.shen@t-online.de>
Date2014-10-10 23:49 +0200
Message-ID<m19k8o$ac5$1@news.albasani.net>
In reply to#4743
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

[toc] | [prev] | [standalone]


Back to top | Article view | comp.programming


csiph-web