Untitled Designn
Untitled Designn
Y
PRAVEEN D PRUTHVI S RANJITH PRABHU
RNNM23MC105 BORKAR
NNM23MC106 NNM23MC113
INTRODUCTIO
N
• Cryptography is the science and art of securing communication by converting information
into a format that is unreadable to unauthorized users, ensuring data privacy and integrity.
• Cryptography has a long history, dating back to ancient times, but it has evolved
• Cryptography means secret writing, a tool for protecting information from unauthorized
access.
HISTORY
• A long time ago, people started using secret writing to
keep their messages safe.
• The oldest secret writing was found on a clay tablet from
Egypt that is over 4,000 years old. It had special pictures
called hieroglyphics written by a scribe. In Egypt, some
people wrote messages with tricky symbols so others
would try to guess what they meant.
• In Babylon, they used funny signs called colophons to hide
MISSION
messages by using numbers instead of letters.
• About 2,500 years ago, Spartan soldiers used a tool
called the sky-tale, which was a stick with a piece of
paper wrapped around it to keep their messages a secret.
All these clever ways of writing helped keep important
information safe, especially for soldiers in battles.
• When sending messages from a sender (S) to a recipient (R), the message often goes
• However, there is a risk that an outsider (O), known as an interceptor or intruder, might try
to access the message after it is sent. This can happen in several ways: they could block
the message from reaching R, intercept it to read its contents, modify it to change the
• These actions can compromise the message's availability, confidentiality, and integrity.
message
produced as output. It depends on the plaintext and the secret key. For a given message,
two
cryptanalysis.
• Cryptology: The art of devising ciphers (cryptography) and breaking them (cryptanalysis)
is
the
ciphertext and same secret key and produces the original plaintext.
converting it into an unreadable format. There are several types of encryption, which can be
1. symmetric encryption
2. asymmetric encryption.
SYMMETRIC
ENCRYPTION
Symmetric encryption uses the same key to both lock (encrypt) and unlock (decrypt)
messages. This means that if we have a message ( P ), we can encrypt it using a key ( K ) to
get ciphertext ( C ) and then use the same key ( K ) to get back the original message. Since
both processes use the same key, symmetric encryption is quick and effi cient, making it great
for handling large amounts of data. However, the downside is that if someone else gets hold
(encrypt) the message and another key (called the private key) to unlock (decrypt) it. This
means that while anyone can use the public key to send a secure message, only the person
with the private key can read it. This makes asymmetric encryption more secure because
even if someone knows the public key, they cannot unlock the messages without the private
key. However, this type of encryption is usually slower and more complex than symmetric
encryption, so it's often used for specific tasks, like securing online transactions
CRYPTANALYSIS
Cryptanalysis is like a puzzle game where someone tries to figure out a secret message that
is hidden. People who do this look at different secret messages and try to find patterns or
They might also try to guess the secret code (called a key) that was used to hide the
message. Sometimes, they find mistakes in how the secret was kept that can help them. It’s a
bit like being a detective, where they use different pieces of information to solve the mystery
of the secret message. There are no strict rules, so they can use any tricks they think of to
1. substitution ciphers
2. transposition ciphers.
SUBSTITUTION CIPHERS
In a substitution cipher, each letter in a message is swapped with another letter. A famous
example is the Caesar Cipher, where letters are shifted by a certain number. For instance, in a
Caesar Cipher where we shift by 3, "a" becomes "d," "b" becomes "e," and so on. So, the word
"attack" becomes "DWWDFN." We can change how much we shift, and that amount is called
the key. Another way to do this is to use a different arrangement of letters altogether, like
mapping "a" to "Q," "b" to "W," and so forth. For example, "attack" would change to
"QZZQEA." Even if someone knows the substitution, there are many possible keys, making it
hard to guess.
TRANSPOSITION
CIPHERS
Transposition ciphers work differently. Instead of swapping letters, they change the order of
the letters in a message but keep the letters themselves the same. For example, if we use a
key like the word "BOENTIKA," we write the message in rows and then read it out in columns
based on the order of the letters in the key. The original message "Please transfer ten
thousand rupees to my Swiss bank account, seven two seven" would be scrambled to form a
different message that looks confusing to anyone who doesn't know the key.
DIGITAL SIGNATURES
A digital signature is a way to prove that a digital message or document is real and has not
been changed. It helps the receiver know that the message comes from a known sender.
Digital signatures are commonly used for software distribution, financial transactions, and
- The signature on the check shows that it's valid, as only the person with the right signature
- Once a check is cashed, it can’t be used again, and most changes to it can be easily
spotted.
DIGITAL SIGNATURES
Digital signatures work differently since there are no physical documents. They involve three
main steps:
2. **Signing:** The sender uses the private key to create a unique signature for the message.
3. **Verification:** The recipient uses the public key to check if the signature is valid.
A digital signature includes a header (who sent it), a body (the message), and a signature (a
special code created from the message). The recipient can verify the signature to ensure the
message is authentic and hasn’t been altered. This helps prevent forgery, which can lead to
misinformation online.
TRANSPOSITION
CIPHERS
Transposition ciphers work differently. Instead of swapping letters, they change the order of
the letters in a message but keep the letters themselves the same. For example, if we use a
key like the word "BOENTIKA," we write the message in rows and then read it out in columns
based on the order of the letters in the key. The original message "Please transfer ten
thousand rupees to my Swiss bank account, seven two seven" would be scrambled to form a
different message that looks confusing to anyone who doesn't know the key.
SPEECH CRYPTOGRAPHY
Speech cryptography is the technique of securing spoken communication by transforming
audio signals into a form that is unreadable to anyone who does not have the proper
authorization. This process typically involves encoding the speech using various encryption
algorithms, which can make it diffi cult for unauthorized listeners to intercept or understand
meetings. The encrypted speech can only be decrypted and understood by someone who
possesses the correct key or password, ensuring that sensitive information remains
transaction, they create a message that includes details like the sender’s address, the
recipient’s address, and the amount of Bitcoin being transferred.Digital Signatures: To ensure
authenticity and integrity, the sender uses their private key to create a digital signature for
the transaction. This signature proves that the sender authorized the transaction and
prevents anyone else from altering it. The transaction details and the sender's public key are
then broadcast to the Bitcoin network. Each node in the network receives the transaction,
SPEECH CRYPTOGRAPHY
Verification: Nodes verify the transaction by using the sender’s public key to check the digital
signature. If the signature is valid and the sender has enough Bitcoin to complete the
together to form a block. Each block contains a cryptographic hash of the previous block,
ensuring the integrity of the entire blockchain. The hash function (SHA-256 for Bitcoin) takes
the block's header (including the hash of the previous block) and creates a unique fixed-size
output. This linking of blocks ensures that if any information in a previous block is changed,
the hash will also change, signaling tampering.Mining: Miners compete to solve a complex
mathematical problem that involves finding a nonce (a random number) that, when hashed
with the block's header, produces a hash that meets certain criteria (e.g., it must start with a
THANK YOU