Crypton

Crypton is an educational library to learn and practice Offensive and Defensive Cryptography. It is basically a collection of explanation and implementation of all the existing vulnerabilities and attacks on various Encryption Systems (Symmetric and Asymmetric), Digital Signatures, Message Authentication Codes and Authenticated Encryption Systems. Each attack is also supplemented with example challenges from “Capture The Flag” contests and their respective write-ups. Individuals who are already acquainted (or are into CTFs) with this field can use Crypton as a tool to solve challenges based on a particular existing vulnerability.

The library will be continuously updated with attack explanations and CTF challenges! Feel free to email me regarding any suggestions!

I have written a blog post on the timeline of development of this library: https://masterpessimistaa.wordpress.com/2018/08/12/announcing-crypton-an-educational-library-to-learn-offensive-and-defensive-cryptography/

WARNING: The author in no way guarantees that the code is secure. The library is only meant for educational purposes and the code should not be used for implementing in real world. All the example scripts in the library are trivial implementations.

There are different sections in this README:

• Motivation- What motivated me to create this library
• Library Structure- Directory structure of Crypton
• Domain Coverage- What all cryptosystems and attacks are covered in this library
• Future Plans/TODO- Attacks/concepts that are to be included soon

---

Motivation

Help CTF players and individuals interested in the field of Cryptography provide a platform for learning attacks in crypto and for experienced CTF players to practice challenges systematically divided into attacks associated with different sub-domains in crypto. Also, illustrate through various attack explanations how proper implementation of protocols is crucial.

---

Library Structure

---

Domain Coverage

1. Block Ciphers

S.No.	Topic	Explanation	Impl./Exploit	Challenge#
1	Block Cipher Basics- working of block ciphers, padding etc.	- [x] [link]	- [ ]	- [ ]
2	Modes of Encryption- different modes of operation on block ciphers: ECB, CBC, CTR	- [x] [link]	- [ ]	- [ ]
3	Block Size Detection- detect blocksize of a block cipher encrypting data on a remote service	- [x] [link]	- [ ]	- [ ]
4	Mode Detection- detect type of mode of encryption: independent or dependent encryption of blocks	- [x] [link]	- [ ]	- [ ]
5	ECB Byte at a Time- byte at a time decryption of a secret string running on a remote service encrypting input+secret in ECB mode	- [x] [link]	- [ ]	- [x] [link]
6	CBC IV Detection- detect the value of Initialisation Vector on a remote service that is encrypting our input using a block cipher in CBC mode	- [x] [link]	- [x] [link]	- [ ]
7	CBC Bit Flipping Attack- exploiting cookie generation mechanism to login as admin when cookie is generated using a block cipher in CBC mode	- [x] [link]	- [ ]	- [x] [link]
8	CBC Byte at a Time- byte at a time decryption of a secret string running on a remote service encrypting input+secret in ECB mode	- [x] [link]	- [x] [link]	- [ ]
9	CBC Padding Oracle Attack- decryption of data encrypted by a vulnerable service providing encryption/decryption	- [x] [link]	- [ ]	- [x] [link]
10	CTR Bit Flipping- exploiting cookie generation mechanism to login as admin when cookie is generated using a block cipher in CBC mode	- [x] [link]	- [ ]	- [x] [link]

2. RSA Encryption

S.No.	Topic	Explanation	Impl./Exploit	Challenge#
1	Unpadded RSA Enc/Dec- key generation, distribution, encryption/decryption, verification of decryption formula and padding in RSA	- [x] [link]	- [ ]	- [ ]
2	Direct Root Attack- attack on unpadded RSA with low public key exponent	- [x] [link]	- [ ]	- [ ]
3	Fermat’s Factorisation- technique used to factor modulus n when p and q values are in proximity	- [x] [link]	- [x] [link]	- [x] [link]
4	Pollard’s p-1 Factorisation- technique to factorise n when both of it’s factors p & q, p-1 and q-1 have very small prime divisors	- [x] [link]	- [x] [link]	- [x] [link]
5	Common Modulus Attack- decrypt ciphertext when it’s corresponding plaintext is encrypted two different times with the same modulus n	- [x] [link]	- [x] [link]	- [x] [link]
6	Common Prime Attack- retrieve factors of moduli n1 and n2 when they have a common factor	- [x] [link]	- [ ]	- [x] [link]
7	Wiener’s Attack- get value of decryption key exponent d when d < N0.25	- [x] [link]	- [x] [link]	- [x] [link]
8	Wiener’s Attack Variant- get value of decryption key exponent d when d is a few bits greater than N0.25 or d < N0.25	- [x] [link]	- [x] [link]	- [x] [link]
9	Coppersmith’s Attack- coppersmith’s theorem, attack on stereotyped messages and factoring n with high bits known	- [x] [link]	- [x] [link]	- [x] [link]
10	Franklin Reiter Related Message Attack- attack to retrieve related messages encrypted using the same modulus	- [x] [link]	- [x] [link]	- [x] [link]
11	Hastad’s Broadcast Attack- with extension- attack to retrieve a message broadcasted among different people, encrypted using same exponent but different moduli	- [x] [link]	- [x] [link]	- [x] [link]
12	PKCS1-v1.5-Padded-RSA-Encryption/Decryption- ASN1 encoding, padded RSA encryption (needs to be fixed)	- [ ]	- [ ]	- [ ]
13	Least Significant Bit Oracle Attack- attack on RSA oracle leaking least significant bit value on decryption	-[x] [link]	-[x] [link]	- [ ]
14	Attack-Retrieve-Modulus- attack on RSA oracle to extract value of modulus in case it is not public	-[x] [link]	-[x] [link]	-[x] [link]
15	Intro-RSA-Challenges- basic challenges in RSA related to Number Theory	- [x] [link]	- [ ]	- [x] [link]

3. Message Authentication Codes (MACs)

S.No.	Topic	Explanation	Impl./Exploit	Challenge#
1	Message Authentication Code- internals and security analysis of MACs	- [x] [link]	- [ ]	- [ ]
2	CBC MAC Forgery- generating two message M1 and M2 having the same CBC-MAC authentication tag	- [x] [link]	- [ ]	- [x] [link]
3	Length Extension Attack on CBC-MAC- generate a valid authentication tag of message M1 || M2 (concatenation) given MAC(M1)	- [x] [link]	- [x] [link]	- [ ]

4. Discrete Logarithm Problem

S.No.	Topic	Explanation	Impl./Exploit	Challenge#
1	DLP- Cyclic Groups, Discrete Logarithm Problem	- [x] [link]	- [ ]	- [x] [link]
2	Pollard’s Rho Algorithm to solve DLP	- [x] [link]	- [x] [link]	- [x] [link]
3	Baby Step Giant Step Algorithm to solve DLP	- [x] [link]	- [x] [link]	- [ ]
4	Pohlig Hellman Algorithm to solve DLP	- [x] [link]	- [x] [link]	- [ ]
5	Elliptic Curve DLP- defining identity element, inverse of a point, cyclic groups over points on an EC, Hasse’s theorem, ECDLP	- [x] [link]	- [ ]	- [ ]
6	Baby Step Giant Step Algorithm to solve Elliptic Curve DLP	- [x] [link]	- [x] [link]	- [ ]
7	Pollard’s Rho Algorithm to solve Elliptic Curve DLP	- [x] [link]	- [x] [link]	- [x] [link]

5. ElGamal Encryption

S.No.	Topic	Explanation	Impl./Exploit	Challenge#
1	ElGamal Cryptosystem- Encryption/Decryption- key generation, encryption, decryption in ElGamal Cryptosystem	- [x] [link]	- [x] [link]	- [x] [link]

6. Authenticated Encryption (AE)

S.No.	Topic	Explanation	Impl./Exploit	Challenge#
1	AE basics & internals- working of authenticated encryption	- [x] [link]	- [ ]	- [ ]
2	AE with MACs- different techniques of implementing AE with MACs: Encrypt and MAC, MAC then encrypt and encrypt then MAC	- [x] [link]	- [ ]	- [ ]
3	Authenticated Ciphers	- [x] [link]	- [ ]	- [ ]
4	AE with Associated Data	- [x] [link]	- [ ]	- [ ]
5	AES-GCM- encryption in AES-GCM, Wegman-Carter MAC	- [x] [link]	- [x] [link]	- [ ]
6	Forbidden Attack on AES-GCM- attack on AES-GCM due to nonce-reuse	- [x] [link]	- [ ]	- [x] [link]

7. Elliptic Curves

S.No.	Topic	Explanation	Impl./Exploit	Challenge#
1	Elliptic Curve Internals- defining Elliptic Curves, point addition, point doubling and scalar multiplication	- [x] [link]	- [x] [python], [sage]	- [ ]

8. Digital Signatures

S.No.	Topic	Explanation	Impl./Exploit	Challenge#
1	ElGamal Signatures- key generation, signature generation, signature verification and correctness of ElGamal Signature scheme	- [x] [link]	- [x] [link]	- [x] [link]
2	Elliptic Curve DSA- signature generation, signature verification and correctness of signature algorithm	- [x] [link]	- [ ]	- [ ]
3	Attack k-reuse ECDSA- forging of ECDSA signatures due to reuse of k	- [x] [link]	- [ ]	- [ ]
4	Unpadded RSA Digital Signatures- signature generation and verification in RSA digital signature scheme	- [x] [link]	- [x] [link]	- [ ]
5	PKCS1-v1.5 padded RSA Digital Signatures	- [x] [link]	- [x] [link]	- [ ]
6	e=3 Bleichenbacher’s Attack	- [x] [link]	- [x] [link]	- [x] [link]

9. Identification

S.No.	Topic	Explanation	Impl./Exploit	Challenge#
1	Identification Internals	- [x] [link]	- [ ]	- [ ]
2	Ephemeral Key Authentication	- [x] [link]	- [ ]	- [x] [link]

10. Diffie Hellman Key Exchange

S.No.	Topic	Explanation	Impl./Exploit	Challenge#
1	Diffie Hellman Key Exchange Internals	- [x] [link]	- [x] [link]	- [ ]
2	Small Subgroup Confinement Attacks	- [x] [link]	- [x] [link]	- [x] [link]
3	Invalid Curve Point Attack	- [x] [link]	- [x] [link]	- [x] [link]

TODO

1. RSA Encryption
   • PKCS1-v1.5 Padded RSA encryption
   • Chosen Ciphertext Attack on RSA Cryptosystem- LSB Decryption Oracle [Done]
   • Padding Oracle Attack on PKCS1 padded RSA encryption system
   • Fermat’s Factorisation
     • Sieve Improvement
   • Coppersmith’s Attack
     • Boneh Durfee Attack
   • Hastad’s Broadcast Attack
     • Implementation of HBA on padded messages
2. Pseudo-Random-Number-Generators
   • Linear Congruential Generator
   • Mersenne Twister PRNG
   • Linear Feedback Shift Register
3. Digital Signatures
   • Blinding Attack on RSA Digital Signatures
4. Diffie Hellman Key Exchange[Done]
   • Elliptic Curve Diffie Hellman
5. [More to be added]

Author

Ashutosh Ahelleya

• Twitter: https://twitter.com/ashutosha_
• Blog: https://masterpessimistaa.wordpress.com
• EmailID: [email protected]