new asymmetric cryptography algorithm

Liste des GroupesRevenir à fm cryptologie 
Sujet : new asymmetric cryptography algorithm
De : remy (at) *nospam* fctpas.fr (remy)
Groupes : fr.misc.cryptologie
Date : 09. Jul 2021, 11:06:14
Autres entêtes
Organisation : Guest of ProXad - France
Message-ID : <60e81170$0$6207$426a74cc@news.free.fr>
User-Agent : Mozilla/5.0 (X11; Linux i686; rv:52.0) Gecko/20100101 Thunderbird/52.9.1
Hello
I would like to present you the structure of an approach that I hope will be innovative
alice makes public 2 values : an integer n and a threshold
n=23167
n=n-n%11
n%11=0
Alice makes publice the 2 integers
n=23166
limite=31
bob
b1=2*3*5*7*11*13*17*19*23*29*31*15972658
b2=125943284
msg=5
publicBob=((n+b1)*b2)+msg
Bob publishes the integer publicBob
Alice use his private key here 11
publicBob%11=5=msg
it is obvious that we can reduce the size of the clek of publicBOB
publicBob=publicBob%(2*3*5*7*11*13*17*19*23*29*31)
pb if I factor n I find the private key of Alice as for RSA
a viewpoint ?
to understand it is necessary to go through my proposal of demonstration , where I use the notion of "signature of an integer"
signature of an integer={n%2,n%3,n%5,n%7,n%11,.....n%p}p>n
merci pour votre attention cdl remy
--
http://remyaumeunier.chez-alice.fr/
toujours autant dyslexique

Date Sujet#  Auteur
09.07 * new asymmetric cryptography algorithm2remy
12.07 `- Re: new asymmetric cryptography algorithm1remy

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal