SlideShare a Scribd company logo
3
Most read
8
Most read
10
Most read
One Time Pad
(Vernam Cipher)




                  July 28, 2012
•   Patrick




                  CRYPTO
•   Rufus
•   Mark K.
•   Mark C.
•   Adams
•   Kelvin M.
                     1
One Time Pad
(Vernam Cipher)




                  July 28, 2012
                  CRYPTO
                     2
OTP History
• First described by Frank Miller in 1882 the one-time pad was
  re-invented in 1917 and patented a couple of years later. It is




                                                                    July 28, 2012
  derived from the Vernam cipher, named after Gilbert Vernam,
  one of its inventors.




                                                                    CRYPTO
• Used by spies of the former USSR (Russia) during the 1960s

• Used a stack of small very thin pages, each with a series
  of random numbers on them. After use, a page would be
  destroyed immediately

                                                                       3
OTP-Working Mechanism
• The encryption-key has at least the same length as the
  plaintext and consists of truely random numbers




                                                               July 28, 2012
• Each letter of the plaintext is 'mixed' with one element
  from the OTP
• This results in a ciphertext that has no relation with the




                                                               CRYPTO
  plaintext when the key is unknown. At the receiving end,
  the same OTP is used to retrieve the original plaintext




                                                                  4
OTP Rules
• The OTP should consist of truely random numbers




                                                           July 28, 2012
• Precisely two copies of the OTP should exist.




                                                           CRYPTO
• The OTP should only be used once.

• Both copies of the OTP are destroyed immediately after
  use.



                                                              5
Why OTP is Unbreakable
•  The key is atleast as long as the message
• The key is truly random (not auto-generated)




                                                           July 28, 2012
• Key and plain text calculated modulo 10/26/2
• Each key should only be used once & destroyed by




                                                           CRYPTO
  sender and receiver
• There should only be 2 copies of the key (1 for sender
  and 1 for receiver)




                                                              6
OTP Criticism
• Distribution of the key was a challenge
• Adding numbers to the plaintext manually, is a time-




                                                           July 28, 2012
  consuming task. It is therefore sometimes thought that
  OTPs are no longer considered practical




                                                           CRYPTO
• Counter: Improved computing power now




                                                              7
OTP Example
• Problem: Alice wishes to send the message "HELLO" to Bob
• ROE: Assume two pads of paper containing identical random




                                                                     July 28, 2012
  sequences of letters were somehow previously produced and
  securely issued to both
• Additional Info:Alice chooses the appropriate unused page




                                                                     CRYPTO
  from the pad.

• How: The way to do this is normally arranged for in advance,
  as for instance 'use the 12th sheet on 1 May', or 'use the next
  available sheet for the next message'. The material on the
  selected sheet is the key for this message. Each letter from the
  pad will be combined in a predetermined way with one letter of
  the message. It is common, but not required, to assign each
                                                                        8
  letter a numerical value: e.g. "A" is 0, "B" is 1, and so on.
OTP Example (Modulo26)
• Here, we combine the key and the message using
  modular addition.




                                                           July 28, 2012
• The numerical values of corresponding message and key




                                                           CRYPTO
  letters are added together, modulo 26.

• If key material begins with "XMCKL" and the message is
  "HELLO", then the coding would be……..




                                                              9
OTP Encryption




     CRYPTO   July 28, 2012
10
OTP Encryption [contd.]
• If a number is larger than 25, then the remainder after
  subtraction of 26 is taken in modular arithmetic fashion.




                                                              July 28, 2012
• This simply means that if your computations "go past" Z,




                                                              CRYPTO
  you start again at A.

• The ciphertext to be sent to Bob is thus "EQNVZ". Bob
  uses the matching key page and the same process, but
  in reverse, to obtain the plaintext.

• Here the key is subtracted from the ciphertext, again
  using modular arithmetic……                                  11
OTP Decryption




                                                             July 28, 2012
                                                             CRYPTO
• NB: If a number is negative then 26 is added to make the
  number positive                                            12
OTP Cryptanalysis
• Suppose Eve intercepts Alice's ciphertext: "EQNVZ".




                                                           July 28, 2012
• If Eve had infinite computing power, she would quickly
  find that the key "XMCKL" would produce the plaintext




                                                           CRYPTO
  "HELLO", but she would also find that the key "TQURI"
  would produce the plaintext "LATER"




                                                           13
OTP Cryptanalysis [contd]
• It is possible to "decrypt" out of the ciphertext any
  message whatsoever with the same number of




                                                              July 28, 2012
  characters, simply by using a different key, and there is
  no information in the ciphertext which will allow Eve to
  choose among the various possible readings of the




                                                              CRYPTO
  ciphertext

• Thus, OTP coined, the “Perfect Cipher”




                                                              14
Try This One:
• Message: COME




                                                                  July 28, 2012
• Key: BABY

• References:




                                                                  CRYPTO
http://www.cs.miami.edu/~burt/learning/Csc609.051/notes/02.html

http://www.cryptomuseum.com/crypto/otp.htm

http://practicalcryptography.com/ciphers/

http://en.wikipedia.org/wiki/One-time_pad                         15

More Related Content

PPTX
One time Pad Encryption
Abdullah Mubashar
 
PPTX
Introduction of cryptography and network security
NEHA PATEL
 
PPTX
Intro to modern cryptography
zahid-mian
 
PPTX
Classical encryption techniques
ramya marichamy
 
PPTX
Classical encryption techniques
Janani S
 
PPT
Cipher techniques
Mohd Arif
 
PPTX
Activity playfair cipher.pptx
karthikaparthasarath
 
PPT
Network Security and Cryptography
Adam Reagan
 
One time Pad Encryption
Abdullah Mubashar
 
Introduction of cryptography and network security
NEHA PATEL
 
Intro to modern cryptography
zahid-mian
 
Classical encryption techniques
ramya marichamy
 
Classical encryption techniques
Janani S
 
Cipher techniques
Mohd Arif
 
Activity playfair cipher.pptx
karthikaparthasarath
 
Network Security and Cryptography
Adam Reagan
 

What's hot (20)

PPTX
Elgamal digital signature
MDKAWSARAHMEDSAGAR
 
PPTX
Cryptography.ppt
kusum sharma
 
PPT
Security Attacks.ppt
Zaheer720515
 
PPTX
Cryptography and Network Security
Pa Van Tanku
 
PPTX
MD5 ALGORITHM.pptx
Rajapriya82
 
PPTX
RSA Algorithm
Srinadh Muvva
 
PPTX
Confusion and Diffusion.pptx
bcanawakadalcollege
 
PPT
Extensible hashing
rajshreemuthiah
 
PPTX
Cryptographic algorithms
Anamika Singh
 
PPTX
Information and network security 13 playfair cipher
Vaibhav Khanna
 
PPTX
Cryptography.ppt
Uday Meena
 
PPT
block ciphers
Asad Ali
 
PPT
Message authentication and hash function
omarShiekh1
 
PPTX
Concurrency Control in Database Management System
Janki Shah
 
PPT
Data encryption standard
Vasuki Ramasamy
 
PPTX
Cryptography
subodh pawar
 
PPTX
Elliptic Curve Cryptography
JorgeVillamarin5
 
PPT
DES (Data Encryption Standard) pressentation
sarhadisoftengg
 
PDF
RSA ALGORITHM
Dr. Shashank Shetty
 
PPTX
Cryptography
jayashri kolekar
 
Elgamal digital signature
MDKAWSARAHMEDSAGAR
 
Cryptography.ppt
kusum sharma
 
Security Attacks.ppt
Zaheer720515
 
Cryptography and Network Security
Pa Van Tanku
 
MD5 ALGORITHM.pptx
Rajapriya82
 
RSA Algorithm
Srinadh Muvva
 
Confusion and Diffusion.pptx
bcanawakadalcollege
 
Extensible hashing
rajshreemuthiah
 
Cryptographic algorithms
Anamika Singh
 
Information and network security 13 playfair cipher
Vaibhav Khanna
 
Cryptography.ppt
Uday Meena
 
block ciphers
Asad Ali
 
Message authentication and hash function
omarShiekh1
 
Concurrency Control in Database Management System
Janki Shah
 
Data encryption standard
Vasuki Ramasamy
 
Cryptography
subodh pawar
 
Elliptic Curve Cryptography
JorgeVillamarin5
 
DES (Data Encryption Standard) pressentation
sarhadisoftengg
 
RSA ALGORITHM
Dr. Shashank Shetty
 
Cryptography
jayashri kolekar
 
Ad

Similar to One Time Pad Encryption Technique (20)

ODP
One-Time Pad Encryption
Charles Southerland
 
PPT
Otp
draihl
 
PPT
Otp2
draihl
 
PPTX
Lecture 2
fadwa_stuka
 
PPT
Cryptography
sharmili priyadarsini
 
PPT
Traditional symmetric-key cipher
Vasuki Ramasamy
 
DOCX
Number Theory In Cryptography
Abhishek Nand
 
PPTX
TOPIC 10 - CRYPTOGRAPHY [REPORTED BY PUSTA].pptx
sndtcdya
 
DOCX
Number Theory In Cryptography
Aadya Vatsa
 
PPT
Crypt
Mir Majid
 
PDF
Image Encryption Using Advanced Hill Cipher Algorithm
IDES Editor
 
PDF
2 classical cryptosystems
dmc5abdulla
 
ODP
Network Security Topic 4 cryptography2
Khawar Nehal [email protected]
 
PDF
Alice & bob public key cryptography 101 - uncon dpc
Joshua Thijssen
 
PPTX
CS8792 - Cryptography and Network Security
vishnukp34
 
PDF
Combined Implementation of Robust Cryptosystem for Non-invertible Matrices ba...
IDES Editor
 
PPTX
Introduction to cryptography part2-final
Taymoor Nazmy
 
PDF
Cryptography System for Online Communication Using Polyalphabetic Substitutio...
Eswar Publications
 
PDF
Mat 140 Cryptology Day 1 Presentation
Robert Talbert
 
PDF
Computer Security (Cryptography) Ch03
Saif Kassim
 
One-Time Pad Encryption
Charles Southerland
 
Otp
draihl
 
Otp2
draihl
 
Lecture 2
fadwa_stuka
 
Cryptography
sharmili priyadarsini
 
Traditional symmetric-key cipher
Vasuki Ramasamy
 
Number Theory In Cryptography
Abhishek Nand
 
TOPIC 10 - CRYPTOGRAPHY [REPORTED BY PUSTA].pptx
sndtcdya
 
Number Theory In Cryptography
Aadya Vatsa
 
Crypt
Mir Majid
 
Image Encryption Using Advanced Hill Cipher Algorithm
IDES Editor
 
2 classical cryptosystems
dmc5abdulla
 
Network Security Topic 4 cryptography2
Khawar Nehal [email protected]
 
Alice & bob public key cryptography 101 - uncon dpc
Joshua Thijssen
 
CS8792 - Cryptography and Network Security
vishnukp34
 
Combined Implementation of Robust Cryptosystem for Non-invertible Matrices ba...
IDES Editor
 
Introduction to cryptography part2-final
Taymoor Nazmy
 
Cryptography System for Online Communication Using Polyalphabetic Substitutio...
Eswar Publications
 
Mat 140 Cryptology Day 1 Presentation
Robert Talbert
 
Computer Security (Cryptography) Ch03
Saif Kassim
 
Ad

Recently uploaded (20)

PDF
NewMind AI Weekly Chronicles - July'25 - Week IV
NewMind AI
 
PDF
MASTERDECK GRAPHSUMMIT SYDNEY (Public).pdf
Neo4j
 
PPTX
The-Ethical-Hackers-Imperative-Safeguarding-the-Digital-Frontier.pptx
sujalchauhan1305
 
PDF
Software Development Methodologies in 2025
KodekX
 
PDF
Automating ArcGIS Content Discovery with FME: A Real World Use Case
Safe Software
 
PDF
The Future of Mobile Is Context-Aware—Are You Ready?
iProgrammer Solutions Private Limited
 
PDF
Accelerating Oracle Database 23ai Troubleshooting with Oracle AHF Fleet Insig...
Sandesh Rao
 
PDF
Tea4chat - another LLM Project by Kerem Atam
a0m0rajab1
 
PPTX
New ThousandEyes Product Innovations: Cisco Live June 2025
ThousandEyes
 
PDF
AI-Cloud-Business-Management-Platforms-The-Key-to-Efficiency-Growth.pdf
Artjoker Software Development Company
 
PDF
How Open Source Changed My Career by abdelrahman ismail
a0m0rajab1
 
PDF
Google I/O Extended 2025 Baku - all ppts
HusseinMalikMammadli
 
PDF
Data_Analytics_vs_Data_Science_vs_BI_by_CA_Suvidha_Chaplot.pdf
CA Suvidha Chaplot
 
PDF
Economic Impact of Data Centres to the Malaysian Economy
flintglobalapac
 
PPTX
IT Runs Better with ThousandEyes AI-driven Assurance
ThousandEyes
 
PDF
The Evolution of KM Roles (Presented at Knowledge Summit Dublin 2025)
Enterprise Knowledge
 
PDF
SparkLabs Primer on Artificial Intelligence 2025
SparkLabs Group
 
PPTX
AI in Daily Life: How Artificial Intelligence Helps Us Every Day
vanshrpatil7
 
PDF
REPORT: Heating appliances market in Poland 2024
SPIUG
 
PDF
Using Anchore and DefectDojo to Stand Up Your DevSecOps Function
Anchore
 
NewMind AI Weekly Chronicles - July'25 - Week IV
NewMind AI
 
MASTERDECK GRAPHSUMMIT SYDNEY (Public).pdf
Neo4j
 
The-Ethical-Hackers-Imperative-Safeguarding-the-Digital-Frontier.pptx
sujalchauhan1305
 
Software Development Methodologies in 2025
KodekX
 
Automating ArcGIS Content Discovery with FME: A Real World Use Case
Safe Software
 
The Future of Mobile Is Context-Aware—Are You Ready?
iProgrammer Solutions Private Limited
 
Accelerating Oracle Database 23ai Troubleshooting with Oracle AHF Fleet Insig...
Sandesh Rao
 
Tea4chat - another LLM Project by Kerem Atam
a0m0rajab1
 
New ThousandEyes Product Innovations: Cisco Live June 2025
ThousandEyes
 
AI-Cloud-Business-Management-Platforms-The-Key-to-Efficiency-Growth.pdf
Artjoker Software Development Company
 
How Open Source Changed My Career by abdelrahman ismail
a0m0rajab1
 
Google I/O Extended 2025 Baku - all ppts
HusseinMalikMammadli
 
Data_Analytics_vs_Data_Science_vs_BI_by_CA_Suvidha_Chaplot.pdf
CA Suvidha Chaplot
 
Economic Impact of Data Centres to the Malaysian Economy
flintglobalapac
 
IT Runs Better with ThousandEyes AI-driven Assurance
ThousandEyes
 
The Evolution of KM Roles (Presented at Knowledge Summit Dublin 2025)
Enterprise Knowledge
 
SparkLabs Primer on Artificial Intelligence 2025
SparkLabs Group
 
AI in Daily Life: How Artificial Intelligence Helps Us Every Day
vanshrpatil7
 
REPORT: Heating appliances market in Poland 2024
SPIUG
 
Using Anchore and DefectDojo to Stand Up Your DevSecOps Function
Anchore
 

One Time Pad Encryption Technique

  • 1. One Time Pad (Vernam Cipher) July 28, 2012 • Patrick CRYPTO • Rufus • Mark K. • Mark C. • Adams • Kelvin M. 1
  • 2. One Time Pad (Vernam Cipher) July 28, 2012 CRYPTO 2
  • 3. OTP History • First described by Frank Miller in 1882 the one-time pad was re-invented in 1917 and patented a couple of years later. It is July 28, 2012 derived from the Vernam cipher, named after Gilbert Vernam, one of its inventors. CRYPTO • Used by spies of the former USSR (Russia) during the 1960s • Used a stack of small very thin pages, each with a series of random numbers on them. After use, a page would be destroyed immediately 3
  • 4. OTP-Working Mechanism • The encryption-key has at least the same length as the plaintext and consists of truely random numbers July 28, 2012 • Each letter of the plaintext is 'mixed' with one element from the OTP • This results in a ciphertext that has no relation with the CRYPTO plaintext when the key is unknown. At the receiving end, the same OTP is used to retrieve the original plaintext 4
  • 5. OTP Rules • The OTP should consist of truely random numbers July 28, 2012 • Precisely two copies of the OTP should exist. CRYPTO • The OTP should only be used once. • Both copies of the OTP are destroyed immediately after use. 5
  • 6. Why OTP is Unbreakable • The key is atleast as long as the message • The key is truly random (not auto-generated) July 28, 2012 • Key and plain text calculated modulo 10/26/2 • Each key should only be used once & destroyed by CRYPTO sender and receiver • There should only be 2 copies of the key (1 for sender and 1 for receiver) 6
  • 7. OTP Criticism • Distribution of the key was a challenge • Adding numbers to the plaintext manually, is a time- July 28, 2012 consuming task. It is therefore sometimes thought that OTPs are no longer considered practical CRYPTO • Counter: Improved computing power now 7
  • 8. OTP Example • Problem: Alice wishes to send the message "HELLO" to Bob • ROE: Assume two pads of paper containing identical random July 28, 2012 sequences of letters were somehow previously produced and securely issued to both • Additional Info:Alice chooses the appropriate unused page CRYPTO from the pad. • How: The way to do this is normally arranged for in advance, as for instance 'use the 12th sheet on 1 May', or 'use the next available sheet for the next message'. The material on the selected sheet is the key for this message. Each letter from the pad will be combined in a predetermined way with one letter of the message. It is common, but not required, to assign each 8 letter a numerical value: e.g. "A" is 0, "B" is 1, and so on.
  • 9. OTP Example (Modulo26) • Here, we combine the key and the message using modular addition. July 28, 2012 • The numerical values of corresponding message and key CRYPTO letters are added together, modulo 26. • If key material begins with "XMCKL" and the message is "HELLO", then the coding would be…….. 9
  • 10. OTP Encryption CRYPTO July 28, 2012 10
  • 11. OTP Encryption [contd.] • If a number is larger than 25, then the remainder after subtraction of 26 is taken in modular arithmetic fashion. July 28, 2012 • This simply means that if your computations "go past" Z, CRYPTO you start again at A. • The ciphertext to be sent to Bob is thus "EQNVZ". Bob uses the matching key page and the same process, but in reverse, to obtain the plaintext. • Here the key is subtracted from the ciphertext, again using modular arithmetic…… 11
  • 12. OTP Decryption July 28, 2012 CRYPTO • NB: If a number is negative then 26 is added to make the number positive 12
  • 13. OTP Cryptanalysis • Suppose Eve intercepts Alice's ciphertext: "EQNVZ". July 28, 2012 • If Eve had infinite computing power, she would quickly find that the key "XMCKL" would produce the plaintext CRYPTO "HELLO", but she would also find that the key "TQURI" would produce the plaintext "LATER" 13
  • 14. OTP Cryptanalysis [contd] • It is possible to "decrypt" out of the ciphertext any message whatsoever with the same number of July 28, 2012 characters, simply by using a different key, and there is no information in the ciphertext which will allow Eve to choose among the various possible readings of the CRYPTO ciphertext • Thus, OTP coined, the “Perfect Cipher” 14
  • 15. Try This One: • Message: COME July 28, 2012 • Key: BABY • References: CRYPTO http://www.cs.miami.edu/~burt/learning/Csc609.051/notes/02.html http://www.cryptomuseum.com/crypto/otp.htm http://practicalcryptography.com/ciphers/ http://en.wikipedia.org/wiki/One-time_pad 15