Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

BASICS and PROVABLEPRIME, a symmetric and an asymmetric encryption scheme

1 view
Skip to first unread message

Mok-Kong Shen

unread,
Aug 17, 2015, 3:04:56 AM8/17/15
to
BASICS is a simple encryption scheme (with authentication) based on
permutations and dynamic substitutions of characters.

In order that the encryption operations involved could be most easily
understood by the common users, the scheme highly closely follows the
simple and popularly known classical schemes of transposition and
substitution but which nonetheless, due to the high dynamics realized
via corresponding computer programming means, are strong enough to
resist attacks of the adversary with modern analysis resources. The
code is available at: http://s13.zetaboards.com/Crypto/topic/7425974/1/

PROVABLEPRIME, Generation of provable primes with Maurer's algorithm,
with illustrative coding of RSA encryption (with authentication) and
digital signature for sequences of fixed-sized plaintext blocks and
RSA pseudo-random bit generation, is available at:
http://s13.zetaboards.com/Crypto/topic/7234475/1/

There is to my knowledge currently no other open-source implementation
of Maurer's algorithm in any other popular programming language. The
demonstration, that digital signatures can be done with RSA alone, i.e.
without additionally employing hashing, appears also to be unique.

M. K. Shen

0 new messages