rsa.ctxt

用java语言编写的rsa加密解密算法

#BlueJ class context
comment0.target=class\ RSA
comment1.params=
comment1.target=BigInteger\ getModulus()
comment10.params=
comment10.target=BigInteger\ getPublicKey()
comment11.params=args
comment11.target=void\ main(String[])
comment12.target=modulus
comment13.target=N
comment14.params=xor
comment14.target=void\ xOrClePrive(BigInteger)
comment14.text=\n@param\ xor\ BigInteger\n\nCette\ m\u95A0hode\ est\ employer\ pour\ encrypt?et\ pour\ d\u958Frypt?les\ cl\u9591s\nC'est\ l'avantage\ du\ ou\ exclusif\ il\ sufi\ de\ r\u959C\u95A0?la\ m\u962De\ opr\u959Eation\ pour\nencod?et\ d\u958Fod?\n\n
comment15.params=message
comment15.target=BigInteger\ encrypt(BigInteger)
comment15.text=Encrypte\ le\ message\ avec\ les\ cl\u959F\ public\npour\ l'encryption\ les\ cl\u959F\ public\ doivent\ etre\ initialis\u9591s\nle\ message\ doit\ \u963Ere\ divis?en\ paket\ de\ N\ /\ 8\ octects\ ou\ bytes\n\n
comment16.target=modulusE
comment17.params=
comment17.target=String\ toString()
comment18.target=privateKey
comment19.target=one
comment2.target=random
comment20.params=p\ n
comment20.target=void\ setPublicKey(BigInteger,BigInteger)
comment21.params=
comment21.target=void\ setPublicKey()
comment22.target=publicKeyE
comment23.target=phi0
comment3.target=publicKey
comment4.params=encrypted
comment4.target=BigInteger\ decrypt(BigInteger)
comment5.target=p2
comment6.target=p1
comment7.params=
comment7.target=void\ setPrivateKey()
comment7.text=\ns'assure\ que\ privateKey\n1.\ n'a\ aucun\ autre\ diviseur\ que\ 1\n2.\ qu'il\ est\ plus\ grand\ que\ le\ plus\ grand\ entre\ p1\ et\ p2\n3.\ qu'il\ est\ plus\ petit\ que\ p1*p2\n\n
comment8.params=N
comment8.target=RSA(int)
comment9.params=inputp1\ inputp2\ inputpublicKey
comment9.target=RSA(BigInteger,BigInteger,BigInteger)
comment9.text=public\ RSA(BigInteger\ inputp1,BigInteger\ inputp2)\ \ \n{\nN\=10;\np1\=inputp1;\np2\=inputp2;\nphi0\ \=\ (p1.subtract(one)).multiply(p2.subtract(one));\ \ \nmodulus\ \=\ p1.multiply(p2);\nsetPublicKey();\nprivateKey\=publicKey.modInverse(phi0);\ \ \nmodulusE\ \=\ modulus;\npublicKeyE\ \=\ publicKey;\n}\n
numComments=24