Scribd
Upload
38 views14 pages

Number Theory and Cryptogrpahy

Uploaded by

freya shah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as KEY, PDF, TXT or read online on Scribd
38 views14 pages

Number Theory and Cryptogrpahy

Uploaded by

freya shah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as KEY, PDF, TXT or read online on Scribd
You are on page 1/ 14

NUMBER THEORY &

CRYPTOGRAPHY

Freya A Shah
“MATHEMATICS IS THE QUEEN
OF THE SCIENCES-AND NUMBER
THEORY IS THE QUEEN OF
MATHEMATICS”

German Mathematician Carl Friedrich Gauss (1777-1885)


THE CODE WHISPERS
. WHY YOU MUST KNOW ABOUT IT?

. DEMYSTIFYING NUMBER THEORY

. THE POWER OF PRIME NUMBERS

. DEMYSTIFYING CRYPTOGRAPHY: WHAT ITS NOT

. RSA ENCRYPTION ALGORITHM


WHY YOU, A MATH CURIOUS
MUST KNOW ABOUT IT NO
MATTER YOUR FIELD OF
RESEARCH!
THE POWER OF PRIME NUMBERS
THE MOST MYSTERIOUS FIGURES IN
MATH

. Miller-Rabin Primality Test is more accurate test than the Fermat’s Primality Test. It is faster and
easy to implement and taking into use for cryptography and its applications.

. Integer Factorisation Algorithms - Pollard’s Rho Algorithm & Quadratic Sieve.

. Computational complexity with Big O in factoring large numbers.

. Asymptotic security

. Quantum computing and alternate approaches in breaking current encryption methods and
something beyond prime number to come.
POLLARD’S RHO ALGORITHM

. It applies the Hare and Tortoise Analogy.

. Mathematical functions are used to define the steps taken at a time on a Modular Track which is based on the
numbers being factored .

. Two selected starting points, the Tortoise and the Hare. Their positions are consistently updated based using
the predefined function [mod n], it refers to the remainder after performing division by that number (n).

. This algorithm relies on the “Birthday Paradox”- even with a large track, there stays a high probability that
both contestants will land on the same spot (the difference is the product of the number being factored).

. It does not work equally efficient with large prime numbers as it does with small prime numbers.

. The Track Size which is determined by the composite number grows exponentially with the increasing count
of digits making it complex for the ‘contestants’ to collide efficiently.
QUADRATIC SIEVE

. Concept of small and large pebbles in a sieve.

. Generates pairs of integers with specific properties related to the number being factored.

. The pairs are then SIFTED to find ones where the difference is a perfect square.

. By combining these SMOOTH squares, the algorithm can find a factor of the original number.

. More powerful than Pollard’s Rho for large numbers.

. Sifting is computationally expensive and its efficiency highly relies on finding smooth squares.

. For tackling truly gigantic primes, more advanced algorithms like the General Number Field Sieve
(GNFS) are employed, but these require significantly more computational resources.
.
DEMYSTIFYING
CRYPTOGRPAHY:
WHAT ITS NOT
“ Cryptography, a digital shield”
MISCONCEPTION 1 : JUST ABOUT CODES AND
CIPHERS

. ENCRYPTION AND DECRYPTION

. PUBLIC KEY CRYPTOGRAPHY

. DIGITAL SIGNATURES AND HASHING

. SECURE PROTOCOLS

. CRYPTOGRAPHIC ALGORITHMS

. CRYPTANALYSIS (BREAKING CODES)


MISCONCEPTION 2: ONLY FOR MATH WHIZZES
NOT JUST FOR MATH
EXPERTS
. While cryptography is established on the concepts of Number Theory, Probability Theory and
Algebra; but, to understanding basic functionalities of cryptography does not require special
mathematical understandings.

. Core principles are about encryption, decryption and and digital signatures.

. How it surrounds you:

>> Online Banking and Shopping >> Password Managers

>> Secure Messaging Apps >> Wi-Fi Security

>> Secure Logins >> Automatic Updates

>> VPNs (Virtual Private Networks) >> Secure Storage of Sensitive Information
MISCONCEPTION 3:UNBREAKABLE ENCRYPTION
CODEMAKERS v.s. CODEBREAKERS

Not Foolproof, But Highly Secure

Code - Makers Code - Breakers Difficulties


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

>> Homomorphic Encryption >> Side-Channel Attacks >> Key Management

>> Lightweight Cryptography >> Social Engineering Attacks >> Usability


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
>>
Healthcare
Encryption - Protects Patient’s Medical Record

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

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy