Modified generator and added proper testing

Author: ashutosh1206

Elgamal-Encryption/example.py

@@ -44,7 +44,7 @@ def _generate_key():
 	# Assigning the largest 1024-bit safe prime as p
 	p = (1 << 1024) - 1093337
 	x = randint(2, p-2)
-	g = 23
+	g = 7
 	q = p - 1
 	h = pow(g, x, p)
 	pubkey = PublicKey(h, p, g, q)
@@ -126,14 +126,15 @@ def _decrypt(ciphertext, privkey):
 	m = (c2*inverse(s, p)) % p
 	return m
 
-def test():
+if __name__ == "__main__":
+	from os import urandom
 	pubkey, privkey = _generate_key()
-	print "h: ", pubkey.h
-	print "p: ", pubkey.p
-	print "g: ", pubkey.g
-	print "q: ", pubkey.q
-	print "x: ", privkey.x
-	print "\n"
-	ct = _encrypt("test string", pubkey)
-	print long_to_bytes(_decrypt(ct, privkey))
-test()
+	for i in range(100):
+		message = chr(1) + urandom(16)
+		ct = _encrypt(message, pubkey)
+		try:
+	 		assert long_to_bytes(_decrypt(ct, privkey)) == message
+		except:
+			print "[-] Something's wrong! Check the implementation!"
+			import sys
+			sys.exit()

README.md

@@ -87,8 +87,9 @@ Help CTF players and individuals interested in the field of Cryptography provide
 
 | S.No. | Topic                       | Explanation                                                                                     | Impl./Exploit | Challenge# |
 |-------|:---------------------------:|:-----------------------------------------------------------------------------------------------:|:------------:|:----------:|
-| 1     | [DLP](https://github.com/ashutosh1206/Crypton/tree/master/Discrete-Logarithm-Problem)- cyclic groups, discrete logarithm problem, Baby-Step-Giant-Step algorithm| <ul><li>- [x] [\[link\]](https://github.com/ashutosh1206/Crypton/blob/master/Discrete-Logarithm-Problem/README.md)</li></ul> | <ul><li>- [ ] </li></ul>| <ul><li>- [x] [\[link\]](https://github.com/ashutosh1206/Crypton/tree/master/Discrete-Logarithm-Problem/Challenges) </li></ul> |
-| 2     | [Elliptic Curve DLP](https://github.com/ashutosh1206/Crypton/tree/master/Discrete-Logarithm-Problem/Elliptic-Curve-DLP)- defining identity element, inverse of a point, cyclic groups over points on an EC, Hasse's theorem, ECDLP | <ul><li>- [x] [\[link\]](https://github.com/ashutosh1206/Crypton/blob/master/Discrete-Logarithm-Problem/Elliptic-Curve-DLP/README.md)</li></ul> | <ul><li>- [ ] </li></ul>| <ul><li>- [ ] </li></ul> |
+| 1     | [DLP](https://github.com/ashutosh1206/Crypton/tree/master/Discrete-Logarithm-Problem)- Cyclic Groups, Discrete Logarithm Problem| <ul><li>- [x] [\[link\]](https://github.com/ashutosh1206/Crypton/blob/master/Discrete-Logarithm-Problem/README.md)</li></ul> | <ul><li>- [ ] </li></ul>| <ul><li>- [x] [\[link\]](https://github.com/ashutosh1206/Crypton/tree/master/Discrete-Logarithm-Problem/Challenges) </li></ul> |
+| 2     | []()
+| 3     | [Elliptic Curve DLP](https://github.com/ashutosh1206/Crypton/tree/master/Discrete-Logarithm-Problem/Elliptic-Curve-DLP)- defining identity element, inverse of a point, cyclic groups over points on an EC, Hasse's theorem, ECDLP | <ul><li>- [x] [\[link\]](https://github.com/ashutosh1206/Crypton/blob/master/Discrete-Logarithm-Problem/Elliptic-Curve-DLP/README.md)</li></ul> | <ul><li>- [ ] </li></ul>| <ul><li>- [ ] </li></ul> |
 
 
 
@@ -117,7 +118,7 @@ Help CTF players and individuals interested in the field of Cryptography provide
 
 | S.No. | Topic                       | Explanation                                                                                     | Impl./Exploit | Challenge# |
 |-------|:---------------------------:|:-----------------------------------------------------------------------------------------------:|:------------:|:----------:|
-| 1     | [Elliptic Curve Internals](https://github.com/ashutosh1206/Crypton/tree/master/Elliptic-Curves)- defining Elliptic Curves, point addition, point doubling and scalar multiplication | <ul><li>- [x] [\[link\]](https://github.com/ashutosh1206/Crypton/blob/master/Elliptic-Curves/README.md)</li></ul> | <ul><li>- [x] [\[python impl.\]](https://github.com/ashutosh1206/Crypton/blob/master/Elliptic-Curves/ellipticcurve.py), [\[sage impl.\]](https://github.com/ashutosh1206/Crypton/blob/master/Elliptic-Curves/ellipticcurve.sage)</li></ul> | <ul><li>- [ ] </li></ul> |
+| 1     | [Elliptic Curve Internals](https://github.com/ashutosh1206/Crypton/tree/master/Elliptic-Curves)- defining Elliptic Curves, point addition, point doubling and scalar multiplication | <ul><li>- [x] [\[link\]](https://github.com/ashutosh1206/Crypton/blob/master/Elliptic-Curves/README.md)</li></ul> | <ul><li>- [x] [\[python\]](https://github.com/ashutosh1206/Crypton/blob/master/Elliptic-Curves/ellipticcurve.py), [\[sage\]](https://github.com/ashutosh1206/Crypton/blob/master/Elliptic-Curves/ellipticcurve.sage)</li></ul> | <ul><li>- [ ] </li></ul> |