Scribd
Upload
4 views

ISS Lab Attacks

The document outlines an assignment for students in the ISS LAB, CS3231 course, requiring them to select one attack on private key cryptography, one on public key cryptography, and one primality testing technique. Students must demonstrate each attack through code or simulation, record a video, and prepare a 5-page report, ensuring originality to avoid penalties. Collaboration is limited to two members, and all submissions must be functional and properly formatted to receive full marks.

Uploaded by

Suhani Talreja
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

ISS Lab Attacks

The document outlines an assignment for students in the ISS LAB, CS3231 course, requiring them to select one attack on private key cryptography, one on public key cryptography, and one primality testing technique. Students must demonstrate each attack through code or simulation, record a video, and prepare a 5-page report, ensuring originality to avoid penalties. Collaboration is limited to two members, and all submissions must be functional and properly formatted to receive full marks.

Uploaded by

Suhani Talreja
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

ISS LAB, CS3231

Session; JAN-MAY 2025

General Instructions:
You must select One attack on private key cryptography algorithm, one attack on public key
cryptography algorithm and one primality testing technique from the list below.
You must demonstrate how each one works via code/tool/simulator, record the video while
narrating the work, and prepare a 5-page plag and AI-free report on it. The video and report
may be submitted to teams as an assignment. You may upload the OneDrive/Google
Drive/cloud link.
Two members are allowed to do this component in CWS. The video and report should have a
proper contribution from both members.
• You must be extremely careful about the repot as it will be passed through Turnitin
software, any plag or AI detected will fetch ZERO marks with no excuses entertained.
• The cloud link should be working, if not then marks will also be cut for the same.
• The video should also be working with proper audio, any issues in this will lead to
marks cutting.
• You must work in a team of maximum two for this activity.

Classical Ciphers:
1. Caesar Cipher
- Brute Force Attack: Exhaustively trying all possible shifts.
- Frequency Analysis: Exploiting the frequency of letters in the ciphertext.

2. Affine Cipher
- Known Plaintext Attack: Utilizing knowledge of plaintext-ciphertext pairs.
- Brute Force Attack: Exhaustively trying all possible keys.

3. Vigenère Cipher
- Kasiski Examination: Identifying repeating patterns to determine key length.
- Frequency Analysis on Key Lengths: Analyzing the frequency of letters at each position in the key.

4. Playfair Cipher
- Playfair Cryptanalysis: Breaking down the Playfair cipher by analyzing digraph frequencies and patterns.
5. Hill Cipher
- Known Plaintext Attack: Exploiting known pairs of plaintexts and ciphertext.
- Matrix Inversion Attack: Attempting to invert the encryption matrix.

6. Rail Fence Cipher


- Brute Force Attack: Trying all possible rail arrangements.
- Pattern Recognition: Identifying the pattern used for encryption.

Modern Ciphers:
7. Data Encryption Standard (DES)
- Brute Force Attack: Exhaustively trying all possible keys.
- Differential Cryptanalysis: Exploiting differences between plaintext pairs.

8. Advanced Encryption Standard (AES)


- AES Key Expansion Attack: Attacking the key expansion process.
- AES Timing Attacks: Exploiting variations in encryption time.

9. Hashing Algorithms (e.g., SHA-256)


- Collision Attack: Finding two different inputs that hash to the same value.
- Length Extension Attack: Extending the hash value with additional content.

10. Birthday Attack on Hash Functions


- Birthday Paradox: Exploiting the probability of collision in hash functions.

11. Meet-in-the-Middle Attack on 2DES


- Exploiting Double Encryption: Breaking 2DES by dividing the attack into two stages.

12. Known Plaintext Attack on Triple DES


- Exploiting Known Pairs: Attacking Triple DES when plaintext-ciphertext pairs are known.

13. Chosen Plaintext Attack on AES


- Adaptive Chosen Plaintext: Selectively choosing plaintexts for encryption.

14. Side-Channel Attack on AES


- Exploiting Power Consumption: Analyzing power consumption during encryption.

15. Frequency Analysis on Block Cipher Output


- Analyzing Output Patterns: Exploiting patterns in the block cipher's output.

Public Key Cryptography:


1. RSA Cryptosystem
- Wiener's Attack: Exploiting low private exponent values.
- Common Modulus Attack: Breaking RSA when two entities use the same modulus.
- Franklin-Reiter Related Message Attack: Breaking RSA with related plaintext-ciphertext pairs.

2. Diffie-Hellman Key Exchange


- Man-in-the-Middle Attack: Intercepting and modifying key exchange messages.
- Small Subgroup Confinement Attack: Exploiting weak parameters.

3. ElGamal Encryption
- Chosen Ciphertext Attack: Gaining information about the plaintext by choosing ciphertexts for
decryption.
- Lattice-Based Attacks: Leveraging lattice-based techniques to break ElGamal.

4. Elliptic Curve Cryptography (ECC)


- Elliptic Curve Factorization: Attempting to factorize the elliptic curve parameters.
- Small Subgroup Attack: Exploiting weak points in the elliptic curve group structure.
- Pollard's rho algorithm for ECC: Breaking ECC by finding collisions.

5. Elliptic Curve Diffie-Hellman (ECDH)


- Invalid Curve Attack: Exploiting errors in the implementation by using an invalid curve.
- Small-Subgroup Attack on ECDH: Breaking ECDH by exploiting weak subgroup structures.
6. Elliptic Curve Digital Signature Algorithm (ECDSA)
- Nonce Reuse Attack: Breaking ECDSA when nonces are reused.
- Fault Attacks on ECDSA: Exploiting faults in the computation of the signature.

7. RSA Timing Attacks


- Exploiting Timing Information: Analyzing variations in execution time during RSA operations.

8. Padding Oracle Attacks on RSA


- Oracle Exploitation: Decrypting ciphertexts without knowledge of the RSA private key.

9. ROCA (Return of Coppersmith's Attack) on RSA


- Factorization Attack: Exploiting weaknesses in the key generation process.

Primality Testing Techniques:


1. Fermat Primality Test
2. Miller-Rabin Primality Test
- Description: Iteratively applying a probabilistic test based on Fermat's Little Theorem.
3. Solovay-Strassen Primality Test
- Description: A probabilistic test combining Euler's criterion and quadratic reciprocity.
4. AKS Primality Test (Agrawal-Kayal-Saxena)
- Description: A deterministic polynomial-time algorithm for primality testing, providing a significant
advancement in this field.
5. Elliptic Curve Factorization
- Description: Applying elliptic curve methods to factorize large numbers, including those used in RSA.
6. Pollard's rho Algorithm for Factorization
- Description: An algorithm for integer factorization, useful in breaking RSA and other cryptosystems.

You might also like