Changeset 105eb27 in git

Timestamp:

Jul 6, 2015, 9:39:08 AM (8 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')

Children:

ddc1937b20b15407322fe606d93ad53240f5b367

Parents:

7036d0b9fb90dfbbb225e698220889d8bfd08fb3

Message:

fix: ddiv vs. / in crypto.lib

File:

• Singular/LIB/crypto.lib (modified) (2 diffs)

Singular/LIB/crypto.lib

@@ -69 +69 @@
   merkle_hellman_transformation(list knapsack, int key, int mod1                generates a hard knapsack for the  Merkle-Hellman Kryptosystem for a given easy knapsack , a multiplicator key and a modulus mod1
   merkle_hellman_encryption(list knapsack, list message)                    encrypts a message with the Merkle-Hellman Kryptosystem, using a hard knapsack and a message encoded as binary list
-  merkle_hellman_decryption(list knapsack, int key, int mod1, int message)          decrypts a message with the multiplicative Merkle-Hellman Kryptosystem, using the hard knapsack, the key, the modulus mod1 and the message encoded as integer   
+  merkle_hellman_decryption(list knapsack, int key, int mod1, int message)          decrypts a message with the multiplicative Merkle-Hellman Kryptosystem, using the hard knapsack, the key, the modulus mod1 and the message encoded as integer
   super_increasing_knapsack(int ksize)                            Creates the smallest super-increasing knapsack of given size ksize
   h_increasing_knapsack(int ksize, int h)                            Creates the smallest h-increasing knapsack of given size ksize and h
@@ -1272 +1272 @@
    if((k mod 2)==0)
    {
-      resu=ellipticMult(N,a,b,P,k/2);
+      resu=ellipticMult(N,a,b,P,k div 2);
       return(ellipticAdd(N,a,b,resu,resu));
    }