We will discuss the following: Stream Ciphers and Block Ciphers, Data Encryption Standard, DES Algorithm, DES Key Creation, DES Encryption, The Strength Of DES.
https://www.youtube.com/watch?v=1-lF4dePpts&list=PLKYmvyjH53q13_6aS4VwgXU0Nb_4sjwuf
The presentation describes basics of cryptography and information security. It covers goals of cryptography, history of cipher symmetric and public key cryptography
4. The Advanced Encryption Standard (AES)Sam Bowne
A lecture for a college course -- CNIT 140: Cryptography for Computer Networks at City College San Francisco
Based on "Understanding Cryptography: A Textbook for Students and Practitioners" by Christof Paar, Jan Pelzl, and Bart Preneel, ISBN: 3642041000
Instructor: Sam Bowne
More info: https://samsclass.info/141/141_F17.shtml
The presentation include:
-Diffie hellman key exchange algorithm
-Primitive roots
-Discrete logarithm and discrete logarithm problem
-Attacks on diffie hellman and their possible solution
-Key distribution center
The presentation describes basics of cryptography and information security. It covers goals of cryptography, history of cipher symmetric and public key cryptography
4. The Advanced Encryption Standard (AES)Sam Bowne
A lecture for a college course -- CNIT 140: Cryptography for Computer Networks at City College San Francisco
Based on "Understanding Cryptography: A Textbook for Students and Practitioners" by Christof Paar, Jan Pelzl, and Bart Preneel, ISBN: 3642041000
Instructor: Sam Bowne
More info: https://samsclass.info/141/141_F17.shtml
The presentation include:
-Diffie hellman key exchange algorithm
-Primitive roots
-Discrete logarithm and discrete logarithm problem
-Attacks on diffie hellman and their possible solution
-Key distribution center
In cryptography, a block cipher is a deterministic algorithm operating on ... Systems as a means to effectively improve security by combining simple operations such as .... Finally, the cipher should be easily cryptanalyzable, such that it can be ...
Project consists of individual modules of encryption and decryption units. Standard T-DES algorithm is implemented. Presently working on to integrate DES with AES to develop stronger crypto algorithm and test the same against Side Channel Attacks and compare different algorithms.
A short introduction to cryptography. What is public and private key cryptography? What is a Caesar Cipher and how do we decrypt it? How does RSA work?
This PPT explains about the term "Cryptography - Encryption & Decryption". This PPT is for beginners and for intermediate developers who want to learn about Cryptography. I have also explained about the various classes which .Net provides for encryption and decryption and some other terms like "AES" and "DES".
In this whole idea of v symmetric cipher model and also cryptography and cryptanalytics, also substitution techniques and transposition techniques and steganography.
CS8792 - Cryptography and Network Securityvishnukp34
this is an engineering subject.this consist of
pgno: 5 - Information security in past & present
pgno: 7 - Aim of Course
pgno: 8 - OSI Security Architecture
pgno: 9 - Security Goals – CIA Triad
pgno: 13 - Aspects of Security
pgno: 17 - ATTACKS
pgno: 22 - Passive Versus Active Attacks
pgno: 23 - SERVICES AND MECHANISMS
The Diffie-Hellman algorithm was developed by Whitfield Diffie and Martin Hellman in 1976.
This algorithm was devices not to encrypt the data but to generate same private cryptographic key at both ends so that there is no need to transfer this key from one communication end to another.
Diffie – Hellman algorithm is an algorithm that allows two parties to get the shared secret key using the communication channel, which is not protected from the interception but is protected from modification.
This presentation contains the contents pertaining to the undergraduate course on Cryptography and Network Security (UITC203) at Sri Ramakrishna Institute of Technology. This covers the ElGamal Cryptosystem.
Computer Security Lecture 4.1: DES Supplementary MaterialMohamed Loey
We will discuss the following: Data Encryption Standard, DES Algorithm, DES Key Creation
https://www.youtube.com/watch?v=1-lF4dePpts&list=PLKYmvyjH53q13_6aS4VwgXU0Nb_4sjwuf
In cryptography, a block cipher is a deterministic algorithm operating on ... Systems as a means to effectively improve security by combining simple operations such as .... Finally, the cipher should be easily cryptanalyzable, such that it can be ...
Project consists of individual modules of encryption and decryption units. Standard T-DES algorithm is implemented. Presently working on to integrate DES with AES to develop stronger crypto algorithm and test the same against Side Channel Attacks and compare different algorithms.
A short introduction to cryptography. What is public and private key cryptography? What is a Caesar Cipher and how do we decrypt it? How does RSA work?
This PPT explains about the term "Cryptography - Encryption & Decryption". This PPT is for beginners and for intermediate developers who want to learn about Cryptography. I have also explained about the various classes which .Net provides for encryption and decryption and some other terms like "AES" and "DES".
In this whole idea of v symmetric cipher model and also cryptography and cryptanalytics, also substitution techniques and transposition techniques and steganography.
CS8792 - Cryptography and Network Securityvishnukp34
this is an engineering subject.this consist of
pgno: 5 - Information security in past & present
pgno: 7 - Aim of Course
pgno: 8 - OSI Security Architecture
pgno: 9 - Security Goals – CIA Triad
pgno: 13 - Aspects of Security
pgno: 17 - ATTACKS
pgno: 22 - Passive Versus Active Attacks
pgno: 23 - SERVICES AND MECHANISMS
The Diffie-Hellman algorithm was developed by Whitfield Diffie and Martin Hellman in 1976.
This algorithm was devices not to encrypt the data but to generate same private cryptographic key at both ends so that there is no need to transfer this key from one communication end to another.
Diffie – Hellman algorithm is an algorithm that allows two parties to get the shared secret key using the communication channel, which is not protected from the interception but is protected from modification.
This presentation contains the contents pertaining to the undergraduate course on Cryptography and Network Security (UITC203) at Sri Ramakrishna Institute of Technology. This covers the ElGamal Cryptosystem.
Computer Security Lecture 4.1: DES Supplementary MaterialMohamed Loey
We will discuss the following: Data Encryption Standard, DES Algorithm, DES Key Creation
https://www.youtube.com/watch?v=1-lF4dePpts&list=PLKYmvyjH53q13_6aS4VwgXU0Nb_4sjwuf
https://mloey.github.io/
We will discuss the following: Develop Project Charter, Develop Project Management Plan, Direct and Manage Project Work, Monitor and Control Project Work, Perform Integrated Change Control, Close Project or Phase.
https://mloey.github.io/courses/security2017.html
https://www.youtube.com/watch?v=td_8AM80DUA&list=PLKYmvyjH53q13_6aS4VwgXU0Nb_4sjwuf&index=2&t=37s
We will discuss the following: Symmetric Encryption, Substitution Techniques, Caesar Cipher, Monoalphabetic Cipher, Playfair Cipher, Hill Cipher
We’ve all seen the recent news stories about companies whose data has been stolen by hackers. What was once a rare event has become all too common, and companies large and small are at risk. While it isn’t always possible to prevent intrusions, you can reduce the risk by encrypting your data. In this presentation, I’ll show you the four ways that SQL Server provides to encrypt data: hashes, cell-level encryption, database-level encryption (also known as transparent data encryption), and backup encryption. We’ll also discuss the keys required for each type of encryption and discuss how to protect the keys themselves.
Nowadays, it is often found a wide range of the securing information. The understanding that the author wants to design is about cryptography. Cryptography is the study of the security of data or information, commonly found in transferring data. One of them is the method of GOST, GOST is an abbreviation of "Gosudarstvennyi Standard" or "Government Standard." The algorithm is simple encryption algorithm which has some processes as many as 32 rounds and uses 64-bit block cipher with 256-bit key. GOST method also uses the S-Box 8 pieces of permanent and XOR operations and Rotate Left Shift. The author chose the GOST topic since the author wants to describe the understanding of the GOST method. The learning is presenting calculation of the encryption and decryption. The learning course is the study of cryptographic methods GOST. Learning software is also designed so that the method can be more easily understood GOST both algorithms and operations contained in this GOST method.
Lecture 4: How it Works: Convolutional Neural NetworksMohamed Loey
We will discuss the following: Filtering, Convolution, Convolution layer, Normalization, Rectified Linear Units, Pooling, Pooling layer, ReLU layer, Deep stacking, Fully connected layer.
We will discuss the following: Deep vs Machine Learning, Superstar Researchers, Superstar Companies, Deep Learning, Deep Learning Requirements, Deep Learning Architectures, Convolution Neural Network, Case studies, LeNet,AlexNet, ZFNet, GoogLeNet, VGGNet, ResNet, ILSVRC, MNIST, CIFAR-10, CNN Optimization , NVIDIA TITAN X.
We will discuss the following: Artificial Neural Network, Perceptron Learning Example, Artificial Neural Network Training Process, Forward propagation, Backpropagation, Classification of Handwritten Digits, Neural Network Zoo.
Design of an Intelligent System for Improving Classification of Cancer DiseasesMohamed Loey
The methodologies that depend on gene expression profile have been able to detect cancer since its inception. The previous works have spent great efforts to reach the best results. Some researchers have achieved excellent results in the classification process of cancer based on the gene expression profile using different gene selection approaches and different classifiers
Early detection of cancer increases the probability of recovery. This thesis presents an intelligent decision support system (IDSS) for early diagnosis of cancer-based on the microarray of gene expression profiles. The problem of this dataset is the little number of examples (not exceed hundreds) comparing to a large number of genes (in thousands). So, it became necessary to find out a method for reducing the features (genes) that are not relevant to the investigated disease to avoid overfitting. The proposed methodology used information gain (IG) for selecting the most important features from the input patterns. Then, the selected features (genes) are reduced by applying the Gray Wolf Optimization algorithm (GWO). Finally, the methodology exercises support vector machine (SVM) for cancer type classification. The proposed methodology was applied to three data sets (breast, colon, and CNS) and was evaluated by the classification accuracy performance measurement, which is most important in the diagnosis of diseases. The best results were gotten when integrating IG with GWO and SVM rating accuracy improved to 96.67% and the number of features was reduced to 32 feature of the CNS dataset.
This thesis investigates several classification algorithms and their suitability to the biological domain. For applications that suffer from high dimensionality, different feature selection methods are considered for illustration and analysis. Moreover, an effective system is proposed. In addition, Experiments were conducted on three benchmark gene expression datasets. The proposed system is assessed and compared with related work performance.
We will discuss the following: Classical Security Methods, AAA, Authentication, Authorization, Accounting, AAA Characteristic, Local Based AAA, Server Based AAA, TACACS+ and RADIUS.
We will discuss the following: CCNAS Overview, Threats Landscape, Hackers Tools, Tools. Kali Linux Parrot Linux Cisco Packet Tracer Wireshark Denial of Service
Distributed DoS
Man In The Middle
Phishing
Vishing
Smishing
Pharming
Sniffer
Password Attack
We will discuss the following: Graph, Directed vs Undirected Graph, Acyclic vs Cyclic Graph, Backedge, Search vs Traversal, Breadth First Traversal, Depth First Traversal, Detect Cycle in a Directed Graph.
We will discuss the following: Sorting Algorithms, Counting Sort, Radix Sort, Merge Sort.Algorithms, Time Complexity & Space Complexity, Algorithm vs Pseudocode, Some Algorithm Types, Programming Languages, Python, Anaconda.
Algorithms Lecture 3: Analysis of Algorithms IIMohamed Loey
We will discuss the following: Maximum Pairwise Product, Fibonacci, Greatest Common Divisors, Naive algorithm is too slow. The Efficient algorithm is much better. Finding the correct algorithm requires knowing something interesting about the problem
Algorithms Lecture 1: Introduction to AlgorithmsMohamed Loey
We will discuss the following: Algorithms, Time Complexity & Space Complexity, Algorithm vs Pseudo code, Some Algorithm Types, Programming Languages, Python, Anaconda.
Deep Learning - Overview of my work IIMohamed Loey
Deep Learning Machine Learning MNIST CIFAR 10 Residual Network AlexNet VGGNet GoogleNet Nvidia Deep learning (DL) is a hierarchical structure network which through simulates the human brain’s structure to extract the internal and external input data’s features
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Safalta Digital marketing institute in Noida, provide complete applications that encompass a huge range of virtual advertising and marketing additives, which includes search engine optimization, virtual communication advertising, pay-per-click on marketing, content material advertising, internet analytics, and greater. These university courses are designed for students who possess a comprehensive understanding of virtual marketing strategies and attributes.Safalta Digital Marketing Institute in Noida is a first choice for young individuals or students who are looking to start their careers in the field of digital advertising. The institute gives specialized courses designed and certification.
for beginners, providing thorough training in areas such as SEO, digital communication marketing, and PPC training in Noida. After finishing the program, students receive the certifications recognised by top different universitie, setting a strong foundation for a successful career in digital marketing.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Normal Labour/ Stages of Labour/ Mechanism of LabourWasim Ak
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
2. Classical Encryption Techniques
Stream Ciphers and Block Ciphers
Data Encryption Standard
DES Algorithm
DES Key Creation
DES Encryption
The Strength Of DES
3. Classical Encryption Techniques
Stream Ciphers and Block Ciphers
Data Encryption Standard
DES Algorithm
DES Key Creation
DES Encryption
The Strength Of DES
4. Classical Encryption Techniques
Stream cipher is one that encrypts a digital data stream one bit or
one byte at a time.
Block cipher is one in which a block of plaintext is treated as a
whole and used to produce a ciphertext block of equal length.
7. Classical Encryption Techniques
Stream Ciphers and Block Ciphers
Data Encryption Standard
DES Algorithm
DES Key Creation
DES Encryption
The Strength Of DES
8. Classical Encryption Techniques
Data Encryption Standard is a symmetric-key algorithm for the
encryption of electronic data.
Developed in the early 1970s at IBM and based on an earlier
design by Horst Feistel.
DES was issued in 1977 by the National Bureau of Standards, now
the National Institute of Standards and Technology (NIST), as
Federal Information Processing Standard 46
9. Classical Encryption Techniques
DES, data are encrypted in 64-bit blocks using a 56 bits (+8 parity
bits) key.
The algorithm transforms 64-bit input in a series of steps into a 64-
bit output.
The same steps, with the same key, are used to reverse the
encryption.
10. Classical Encryption Techniques
DES uses "keys" where are also apparently 16 hexadecimal
numbers long, or apparently 64 bits long. However, every 8th key
bit is ignored in the DES algorithm, so that the effective key size is
56 bits.
11. Classical Encryption Techniques
Stream Ciphers and Block Ciphers
Data Encryption Standard
DES Algorithm
DES Key Creation
DES Encryption
The Strength Of DES
12. Classical Encryption Techniques
Initial permutation
Round 1
Round 2
Round 16
32 bit Swap
Inverse initial permutation
64-bit Plain text
64-bit Cipher text
Permuted choice 1
Left Circular Shift
Left Circular Shift
Left Circular Shift
64-bit Key
Permuted choice 2
Permuted choice 2
Permuted choice 2
56 bit
56 bit
56 bit
56 bit
56 bit
56 bit
48 bit
48 bit
48 bit
K1
K2
K16
64 bit
64 bit
64 bit
64 bit
64 bit
13. Classical Encryption Techniques
Stream Ciphers and Block Ciphers
Data Encryption Standard
DES Algorithm
DES Key Creation
DES Encryption
The Strength Of DES
14. Classical Encryption Techniques
Initial permutation
Round 1
Round 2
Round 16
32 bit Swap
Inverse initial permutation
64-bit Plain text
64-bit Cipher text
Permuted choice 1
Left Circular Shift
Left Circular Shift
Left Circular Shift
64-bit Key
Permuted choice 2
Permuted choice 2
Permuted choice 2
56 bit
56 bit
56 bit
56 bit
56 bit
56 bit
48 bit
48 bit
48 bit
K1
K2
K16
64 bit
64 bit
64 bit
64 bit
64 bit
17. Classical Encryption Techniques
Let K be the hexadecimal key K = 133457799BBCDFF1
K (binary) = 00010011 00110100 01010111 01111001
10011011 10111100 11011111 11110001
K=64bit
The DES algorithm uses the following steps:
34. Classical Encryption Techniques
Initial permutation
Round 1
Round 2
Round 16
32 bit Swap
Inverse initial permutation
64-bit Plain text
64-bit Cipher text
Permuted choice 1
Left Circular Shift
Left Circular Shift
Left Circular Shift
64-bit Key
Permuted choice 2
Permuted choice 2
Permuted choice 2
56 bit
56 bit
56 bit
56 bit
56 bit
56 bit
48 bit
48 bit
48 bit
K1
K2
K16
64 bit
64 bit
64 bit
64 bit
64 bit
35. Classical Encryption Techniques
Stream Ciphers and Block Ciphers
Data Encryption Standard
DES Algorithm
DES Key Creation
DES Encryption
The Strength Of DES
36. Classical Encryption Techniques
Initial permutation
Round 1
Round 2
Round 16
32 bit Swap
Inverse initial permutation
64-bit Plain text
64-bit Cipher text
Permuted choice 1
Left Circular Shift
Left Circular Shift
Left Circular Shift
64-bit Key
Permuted choice 2
Permuted choice 2
Permuted choice 2
56 bit
56 bit
56 bit
56 bit
56 bit
56 bit
48 bit
48 bit
48 bit
K1
K2
K16
64 bit
64 bit
64 bit
64 bit
64 bit
38. Classical Encryption Techniques
M=0000 0001 0010 0011 0100 0101 0110 0111 1000 1001
1010 1011 1100 1101 1110 1111
Applying the initial permutation to the block of text P (64bit).
IP=100 1100 0000 0000 1100 1100 1111 1111 1111 0000
1010 1010 1111 0000 1010 1010
39. Classical Encryption Techniques
Initial permutation
Round 1
Round 2
Round 16
32 bit Swap
Inverse initial permutation
64-bit Plain text
64-bit Cipher text
Permuted choice 1
Left Circular Shift
Left Circular Shift
Left Circular Shift
64-bit Key
Permuted choice 2
Permuted choice 2
Permuted choice 2
56 bit
56 bit
56 bit
56 bit
56 bit
56 bit
48 bit
48 bit
48 bit
K1
K2
K16
64 bit
64 bit
64 bit
64 bit
64 bit
40. Classical Encryption Techniques
Divide the permuted block IP into a left half L0 of 32 bits, and a right
half R0 of 32 bits.
L0 = 1100 1100 0000 0000 1100 1100 1111 1111
R0 = 1111 0000 1010 1010 1111 0000 1010 1010
Ln = Rn-1
Rn = Ln-1 ⊕ f (Rn-1,Kn)
48. Classical Encryption Techniques
We have not yet finished calculating the function f
We now have 48 bits, or eight groups of six bits. We now do
something strange with each group of six bits: we use them as
addresses in tables called "S boxes".
f(Kn , E(Rn-1)) =B1B2B3B4B5B6B7B8
where each Bi is a group of six bits. We now calculate
S1(B1) S2(B2) S3(B3) S4(B4) S5(B5) S6(B6) S7(B7) S8(B8)
49. Classical Encryption Techniques
The net result is that the eight groups of 6 bits are transformed into
eight groups of 4 bits (the 4-bit outputs from the S boxes) for 32 bits
total.
50. Classical Encryption Techniques
For example, for input block B = 011011 the first bit is "0" and the
last bit "1" giving 01 as the row. This is row 1. The middle four bits
are "1101". This is the binary equivalent of decimal 13, so the
column is column number 13. In row 1, column 13 appears 5. This
determines the output; 5 is binary 0101, so that the output is 0101.
Hence S1(011011) = 0101.
52. Classical Encryption Techniques
K1 ⊕ E(R0) = 011000 010001 011110 111010 100001 100110
010100 100111.
S1(B1)S2(B2)S3(B3)S4(B4)S5(B5)S6(B6)S7(B7)S8(B8) = 0101 1100 1000
0010 1011 0101 1001 0111
The final stage in the calculation of f is to do a permutation P of
the S-box output to obtain the final value of f :
f = P(S1(B1)S2(B2)...S8(B8))
57. Classical Encryption Techniques
Initial permutation
Round 1
Round 2
Round 16
32 bit Swap
Inverse initial permutation
64-bit Plain text
64-bit Cipher text
Permuted choice 1
Left Circular Shift
Left Circular Shift
Left Circular Shift
64-bit Key
Permuted choice 2
Permuted choice 2
Permuted choice 2
56 bit
56 bit
56 bit
56 bit
56 bit
56 bit
48 bit
48 bit
48 bit
K1
K2
K16
64 bit
64 bit
64 bit
64 bit
64 bit
58. Classical Encryption Techniques
In the next round, we will have L2 = R1, which is the block we just
calculated, and then we must calculate R2 =L1 ⊕ f( R1, K2), and so
on for 16 rounds.
At the end of the sixteenth round we have the blocks L16 and R16.
We then reverse the order of the two blocks into the 64-bit block
59. Classical Encryption Techniques
If we process all 16 blocks using the method defined previously, we get,
on the 16th round
L16 = 0100 0011 0100 0010 0011 0010 0011 0100
R16 = 0000 1010 0100 1100 1101 1001 1001 0101
We reverse the order of these two blocks and apply the final permutation
to
R16L16 = 00001010 01001100 11011001 10010101 01000011
01000010 00110010 00110100
60. Classical Encryption Techniques
Initial permutation
Round 1
Round 2
Round 16
32 bit Swap
Inverse initial permutation
64-bit Plain text
64-bit Cipher text
Permuted choice 1
Left Circular Shift
Left Circular Shift
Left Circular Shift
64-bit Key
Permuted choice 2
Permuted choice 2
Permuted choice 2
56 bit
56 bit
56 bit
56 bit
56 bit
56 bit
48 bit
48 bit
48 bit
K1
K2
K16
64 bit
64 bit
64 bit
64 bit
64 bit
62. Classical Encryption Techniques
R16L16 = 00001010 01001100 11011001 10010101 01000011
01000010 00110010 00110100
IP-1 = 10000101 11101000 00010011 01010100 00001111
00001010 10110100 00000101
which in hexadecimal format is
85E813540F0AB405
63. Classical Encryption Techniques
Initial permutation
Round 1
Round 2
Round 16
32 bit Swap
Inverse initial permutation
64-bit Plain text
64-bit Cipher text
Permuted choice 1
Left Circular Shift
Left Circular Shift
Left Circular Shift
64-bit Key
Permuted choice 2
Permuted choice 2
Permuted choice 2
56 bit
56 bit
56 bit
56 bit
56 bit
56 bit
48 bit
48 bit
48 bit
K1
K2
K16
64 bit
64 bit
64 bit
64 bit
64 bit
65. Classical Encryption Techniques
Stream Ciphers and Block Ciphers
Data Encryption Standard
DES Algorithm
DES Key Creation
DES Encryption
The Strength Of DES
66. Classical Encryption Techniques
With a key length of 56 bits, there are 256
possible keys
Brute force search looks hard
Fast forward to 1998. Under the direction of John Gilmore of the EFF, a
team spent $220,000 and built a machine that can go through the entire
56-bit DES key space in an average of 4.5 days.
On July 17, 1998, they announced they had cracked a 56-bit key in 56
hours. The computer, called Deep Crack, uses 27 boards each
containing 64 chips, and is capable of testing 90 billion keys a second.