Scribd
Upload
4 views

Notes Math

The document discusses the principles of RSA cryptography, highlighting the importance of Euler's totient function in generating secure encryption and decryption keys. It explains the role of prime numbers in number theory as foundational elements for cryptography and addresses common misconceptions about encryption's security and applications. Additionally, it covers elliptic curve cryptography (ECC) and its advantages in secure key exchange and data protection.

Uploaded by

freya shah
Copyright
© © All Rights Reserved
Available Formats
Download as KEY, PDF, TXT or read online on Scribd
4 views

Notes Math

The document discusses the principles of RSA cryptography, highlighting the importance of Euler's totient function in generating secure encryption and decryption keys. It explains the role of prime numbers in number theory as foundational elements for cryptography and addresses common misconceptions about encryption's security and applications. Additionally, it covers elliptic curve cryptography (ECC) and its advantages in secure key exchange and data protection.

Uploaded by

freya shah
Copyright
© © All Rights Reserved
Available Formats
Download as KEY, PDF, TXT or read online on Scribd
You are on page 1/ 11

Presentation notes

AMTI
EXAMPLE - SECRET KEY TRIANGLE
For example:
You pick two numbers (like 7 and 11) to build your lock. You calculate a special number using Euler's function,
NUMBER
ϕ(n)=(p−1)(q−1), THEORY
which .
helps design your secret key. Thanks to this math trick, only you can unlock the secret
messages! Euler's function is to make sure the lock and key system is super secure.
If n=10, the…………………………
totient function ϕ(10) = 4, meaning there are 4 numbers (1, 3, 7, 9) that are relatively prime to 10.
Here’s how it helps
Prime in RSA cryptography:
numbers are
the building
Step-by-Step blocks
Use of ϕ(10) in RSA:
1. of Prime
Pick Two all integers.
NumbersThey
p and q: Let's assume this is just an example, so n=10 is given (though in real RSA,
n is a product of largeonly
are divisible primes).
by
2. Calculate ϕ(10): As you found, ϕ(10) = 4, This is a critical value for choosing the encryption and decryption
1 and themselves.
keys.
3. Choose For
an example, 7 ise:aPick a number e such that: 1 < e < ϕ(10) (so 1 < e < 4). e must also be relatively
Encryption Key
prime prime
to ϕ(10)number
(so it has no common factors with 4). For example, you could choose e = 3.
4. Find the Decryption Key d: The decryption key d is the number that satisfies: d ⋅ e ≡ 1 (mod ϕ(10)). For e = 3:
because its only
Solve d ⋅ 3 ≡ 1 (mod 4). The solution is d = 3 (since 3 ⋅ 3 = 9, and 9 mod 4 = 1).
Public and divisors are 1 and 7.
Private Keys:
Understanding
Public key: (e, n) = (3, 10)
prime
Private key: (d,numbers is
n) = (3, 10)
essential
Encryption for
and Decryption:
cryptography.
To send a message m, encrypt it as: c = m^e mod n.
Decrypt it as: m = c^d
Numerical mod n.
Instance:
Example with Message m = 7:
2, 3, 5, 7, 11, 13 are
Encrypt: c = 7^3 mod 10 = 343 mod 10 = 3
prime
Decrypt: numbers.
m = 3^3 mod 10 = 27 mod 10 = 7
Thus, Euler's totient ϕ(n) ensures the encryption and decryption keys work securely together!
FUNDAMENTAL CONCEPTS OF NUMBER THEORY
NUMBER THEORY.

…………………………
Prime numbers are
the building blocks
of all integers. They
are divisible only by
1 and themselves.
For example, 7 is a
prime number
because its only
divisors are 1 and 7.
Understanding
prime numbers is
essential for
cryptography.
Numerical Instance:

AFTER RSA
2, 3, 5, 7, 11, 13 are
prime numbers.
FUNDAMENTAL CONCEPTS OF NUMBER THEORY
NUMBER THEORY.

…………………………
Prime numbers are
the building blocks
of all integers. They
are divisible only by
1 and themselves.
For example, 7 is a
prime number
because its only
divisors are 1 and 7.
Understanding
prime numbers is
essential for
cryptography.
Numerical Instance:
2, 3, 5, 7, 11, 13 are
prime numbers.
“CONCLUSION”
Number theory provides the
mathematical foundation for No need, keep it
modern cryptography, enabling
secure communication and data
aligns with the time
protection. limit
As technology advances,
cryptography continues to evolve,
with new algorithms and techniques
emerging to address evolving
security challenges.
MISCONCEPTION 3:UNBREAKABLE
ENCRYPTION
CODEMAKERS v.s. CODEBREAKERS

Not Foolproof, But Highly


Secure

Code - Makers Code - Breakers Difficulties


>> Post-Quantum >> Increased Computing >>
Cryptography Power Standardisation

>> Homomorphic >> Side-Channel Attacks >> Key


Encryption Management
>> Social Engineering
>> Lightweight Attacks >> Usability
Cryptography
Add a little bit of elaborated definition, and possibly an
illustration
ELLIPTIC CURVE CRYPTOGRAPHY
(ECC
)
Point Addition - ECC relies on the properties of elliptic curves, where points are
added using a specific formula.

Discrete Logarithm Problem - The security of ECC is based on the difficulty of


finding the discrete logarithm of a point on elliptic curve.

Key Exchange - ECC offers efficient key exchange methods like elliptic curve
Diffie-Hellman (ECDH), similar to the Diffie-Hellman protocol but using elliptic
curves.

Key Generation - ECC uses points on an elliptic curve to generate keys, offering
higher security with smaller key sizes.

Encryption - ECC encryption involves manipulating points on the curve to


encrypt data, providing strong security for sensitive information.
MISCONCEPTION 4: PROTECTS ONLY
PHYSICAL OBJECTS
SECURES DIGITAL INFORMATION

>> Finance
Encryption - Safeguards online banking transactions

Decryption - Grants access with a PIN

Data Integrity - ensures funds haven’t been tampered with


during transfer
>>
Healthc
Encryption - Protects Patient’s Medical Record
are
Decryption - allows authorised doctor’s access

Data Integrity - guarantees the records haven’t


been altered

>>
Communication
Encryption - Scrambles messages before sending

Decryption - Unlocks them with a password

Data Integrity - Verifies messages weren’t modified


in transit
No
need
“MATHEMATICS IS THE QUEEN
OF THE SCIENCES-AND
NUMBER THEORY IS THE
QUEEN OF MATHEMATICS”

German Mathematician Carl Friedrich Gauss (1777-1885)


MISCONCEPTION 1 : JUST ABOUT CODES AND
CIPHERS

ENCRYPTION AND DECRYPTION

PUBLIC KEY CRYPTOGRAPHY

DIGITAL SIGNATURES AND HASHING

SECURE PROTOCOLS

CRYPTOGRAPHIC ALGORITHMS

CRYPTANALYSIS (BREAKING CODES)

You might also like