Prof. Saravanan Vijayakumaran

Slides:



Advertisements
Similar presentations
Siyang Tian. TOPIC 1.SIM CARD card embedded with subscriber identity module 2. 3G network 3rd generation mobile telecommunications.
Advertisements

Logical Operations on Images Boolean logic is a system of logical operations defined by George Boole in the mid 19th century to apply algebraic operations.
Syed Safi Uddin Qadri BETL/F07/0112 GSM Stream Cipher Algorithm Presented To Sir Adnan Ahmed Siddiqui.
High Boost filtering In image processing, it is often desirable to emphasize high frequency components representing the image details without eliminating.
Digital Kommunikationselektroink TNE027 Lecture 6 (Cryptography) 1 Cryptography Algorithms Symmetric and Asymmetric Cryptography Algorithms Data Stream.
Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,
SDS-PAGE gel analysis SDS-PAGE analysis is done to study the expression of a protein from the control and the sample, to detect the molecular weight of.
Syndrome Decoding of Linear Block Code
Binary Exponential Backoff Binary exponential backoff refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is.
Document that explains the chosen concept to the animator.
Linear Feedback Shift Register. 2 Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple.
Driving force for solidification This Learning object ‏ will introduce the concept of undercooling and driving force for phase transformations Subject:
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
TOPIC : Signature Analysis. Introduction Signature analysis is a compression technique based on the concept of (CRC) Cyclic Redundancy Checking It realized.
Logic Gates Part – III : Combinational Logic Gates Combinational Logic Circuits are made up from basic logic NAND, NOR or NOT gates that are "combined"
ID template 5.0 for creating learning objects Created by OSCAR team October 2011 INSTRUCTIONS SLIDE: DO NO EDIT.
Electrical Resistivity in Superconductors The electrical resistivity of many metals and alloys drops suddenly to zero when the specimen is cooled to a.
SOLID SOLUTION STRENGTHENING
Template for the Storyboard stage. General Instructions: The template shown is an example. You can add more slides if required. Include images for explaining.
Welcome This is a template to create an Instructional Design Document of the concept you have selected for creating animation. This will take you through.
Line Coding Schemes ‏Line coding is the process of converting binary data, a sequence of bits to a digital signal. Authors Phani Swathi Chitta Mentor Prof.
Convolutional Coding In telecommunication, a convolutional code is a type of error- correcting code in which m-bit information symbol to be encoded is.
Isothermal reversible ideal gas system The concepts deals with system in which the temperature of the system is constant With the help of this animation.
Edge Detection using Laplacian of Gaussian Edge detection is a fundamental tool in image processing and computer vision. It identifies points in a digital.
CSMA/CA Simulation  Course Name: Networking Level(UG/PG): UG  Author(s) : Amitendu Panja, Veedhi Desai  Mentor: Aruna Adil *The contents in this ppt.
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
Gaussian Smoothing Gaussian Smoothing is the result of blurring an image by a Gaussian function. It is also known as Gaussian blur.  Course Name: Digital.
CSMA/CD Simulation Carrier Sense Multiple Access (CSMA), although more efficient than ALOHA or slotted ALOHA, still has one glaring inefficiency: When.
Linear Search Linear Search is a fundamental search algorithm. Linear search, also known as sequential search, is a process that checks every element in.
Median Filtering In signal processing, it is often desirable to be able to perform some kind of noise reduction on an image or signal. The median filter.
Electrical Resistivity in Superconductors The electrical resistivity of many metals and alloys drops suddenly to zero when the specimen is cooled to a.
Go-Back-N ARQ (Sliding Window Protocol) Go-Back-N is an instance of the Automatic Repeat-request (ARQ) Protocol, in which the sending process continues.
Document that explains the chosen concept to the animator 1.
Clarification Dynamics and Limiting Flux Solid Flux analysis for the design of clarifier area requirement in the sludge thickening of wastewater treatment.
Process Scheduling In multiprogramming systems, when there is more than one ready process, the operating system must decide which one to activate. The.
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
05/09/11Project OSCAR IDD Template 4.7 Instructional Design Document Version Project OSCAR IDD Template 4.7.
Ciphering in GSM Mobile Stations Base Station Subsystem Exchange System Network Management Subscriber and terminal equipment databases BSC MSC VLR HLR.
05/09/11Project OSCAR IDD Template 4.7 Instructional Design Document Version Project OSCAR IDD Template 4.7.
Page : 1 bfolieq.drw Technical University of Braunschweig IDA: Institute of Computer and Network Engineering  W. Adi 2011 Lecture-7 Secret-Key Ciphers.
Document that explains the chosen concept to the animator
Created by OSCAR team October 2011
Learning Objectives After interacting with this Learning Object, the learner will be able to: Explain the process of collision detection in CSMA/CD.
Information of the LO Subject: Information Theory Domain: Algorithms
Stream Ciphers Day 18.
Topic 6 LC-3.
Document that explains the chosen concept to the animator
Prof. Saravanan Vijayakumaran
Welcome 1 This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
Welcome 1 This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
Chain folding - lamella
Simulation of Session Initiation Protocol
Dilation The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.
Closing One of the important morphological operations applied to either grayscale or binary images is Closing. It is derived from the fundamental operations.
Erosion The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.
Virtual Memory Virtual memory is a technique which gives an application program the impression that it has contiguous working memory, while in fact it.
Transformation of Continuous Time Signals
Binary Search A binary search algorithm finds the position of a specified value within a sorted array. Binary search is a technique for searching an ordered.
Sorted Linked List A linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains.
Document that explains the chosen concept to the animator
Discrete Convolution of Two Signals
Continuous Time Convolution
Cryptology Design Fundamentals
Welcome 1 This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
CH 6. Stream Ciphers Information Security & IoT Lab 김해용
Document that explains the chosen concept to the animator
Information and Computer Security CPIS 312 Lab 4 & 5
Party Problem The simplest example of Ramsey theory. It is also known as the ‘Maximum Clique Problem’. A clique of a graph is a complete sub graph of the.
Opening One of the important morphological operations applied to either grayscale or binary images is Opening. It is derived from the fundamental operations.
Image Sharpening using Laplacian
Presentation transcript:

Prof. Saravanan Vijayakumaran A5/1 Stream Cipher A5/1 is a stream cipher used to provide over-the- air communication privacy in the GSM cellular telephone standard Course Name: Cryptography Level: UG/PG Authors Phani Swathi Chitta Mentor Prof. Saravanan Vijayakumaran

Learning Objectives After interacting with this Learning Object, the learner will be able to: Explain the regular operation of A5/1 Explain the operation of initial state generation using session key and publicly known frame number

1 2 3 4 5 Definitions of the components/Keywords: A5/1 is built from three short linear feedback shift registers (LFSR) of lengths 19, 22, and 23 bits, which are denoted by R1, R2 and R3 respectively. The rightmost bit in each register is labeled as bit zero. The taps of R1 are at bit positions 13,16,17,18; the taps of R2 are at bit positions 20,21 and the taps of R3 are at bit positions 7, 20,21,22. When a register is clocked, its taps are XORed together and the result is stored in the rightmost bit of the left-shifted register. They are clocked in a stop/go fashion using the following majority rule: Each register has a single "clocking" tap (bit 8 for R1, bit 10 for R2, and bit 10 for for R3); each clock cycle, the majority function of the clocking taps is calculated and only those registers whose clocking taps agree with the majority bit are actually clocked. At each step either two or three registers are clocked. 2 3 4 LFSR number Length in bits Feedback polynomial Clocking bit Tapped bits 1 19 x19 + x18 + x17 + x14 + 1 8 13,16,17,18 2 22 x22 + x21 + 1 10 20,21 3 23 x23 + x22 + x21 + x8 + 1 7,20,21,22 5 3

1 Master Layout 1 2 3 4 5 1 1 1 clock control 18 17 16 13 R1 C1 21 20 Part 1 - Regular operation of A5/1 Part 2 - Operation of initial state generation using session key and publicly known frame number 18 17 16 13 1 R1 2 C1 clock control 21 20 R2 1 3 C2 4 21 22 20 7 1 R3 C3 5 The master layout figure should appear first R1, R2, R3 are three linear feedback shift registers C1,C2 and C3 are clocking bits

3 Step 1: 1 2 4 5 1 1 1 1 clock control 18 17 16 13 R1 C1 21 20 R2 C2 1 1 R1 LFSR – Linear Feedback Shift Register MSB – Most Significant Bit LSB – Least Significant Bit C1 clock control 2 21 20 1 R2 1 C2 3 21 22 20 7 1 R3 4 C3 Instruction for the animator Text to be displayed in the working area (DT) The first sentence in DT should appear with master layout figure. The first blue circle should blink once and red 1 should appear. The second sentence in DT should appear with step 1 figure. The contents of the three LFSRs represent the state of the A5/1 stream cipher The MSBs of all the registers are XORed to generate the output of the stream cipher 5

3 Step 2: 1 2 4 5 1 1 1 1 clock control 18 17 16 13 R1 C1 21 20 R2 C2 1 R1 C1 2 clock control 21 20 1 R2 1 3 C2 21 22 20 7 4 1 R3 C3 Instruction for the animator Text to be displayed in the working area (DT) The orange lines should blink once. The registers are clocked in a stop/go fashion using the majority rule. A register is clocked if the clocking bit agrees with the majority bit. 5

3 Step 3: 1 2 4 5 1 1 1 1 1 clock control 18 17 16 13 R1 C1 21 20 R2 1 1 R1 1 C1 clock control 2 21 20 1 R2 1 C2 3 21 22 20 7 1 R3 4 C3 Instruction for the animator Text to be displayed in the working area (DT) The 3 violet circles in first register and 3 violet circles in third register should blink once. The text in DT should be displayed. After the text in DT red 1 at R1 and red 0 at R3 should appear The LFSRs R1 and R3 are clocked as their clocking bits C1 and C3 agree with the majority of C1, C2 and C3. LFSR R2 is not clocked. When a register is clocked, its taps are XORed together to generate the new LSB. 5

3 Step 4: 1 2 4 5 1 1 1 1 1 clock control 18 17 16 13 R1 C1 21 20 R2 1 R1 1 C1 2 clock control 21 20 1 R2 1 3 C2 21 22 20 7 4 1 R3 C3 Instruction for the animator Text to be displayed in the working area (DT) The figure in step4 should be shown such that the bits (1s and 0s ) are moved to left in R1 and R3. The contents of LFSRs R1 and R3 are left shifted. 5

3 Step 5: 1 2 4 5 1 1 1 1 clock control 18 17 16 13 R1 C1 21 20 R2 C2 1 R1 C1 2 clock control 21 20 1 R2 1 3 C2 21 22 20 7 4 1 R3 C3 Instruction for the animator Text to be displayed in the working area (DT) The figure in step 5 should appear such that the red 1 and 0 are placed in R1 and R3. The new LSBs which were generated prior to left shifting of the registers is stored in the rightmost bit of the left -shifted registers. 5

3 Step 6: 1 2 4 5 1 1 1 1 1 clock control 18 17 16 13 R1 C1 21 20 R2 1 1 R1 C1 clock control 2 21 20 1 1 R2 1 C2 3 21 22 20 7 1 R3 4 C3 Instruction for the animator Text to be displayed in the working area (DT) The first blue circle should blink once and green 1 should appear. The sentence in DT should appear with step 6 figure. The MSBs of all the registers are XORed to generate the output of the stream cipher 5

3 Step 7: 1 2 4 5 1 1 1 1 1 clock control 18 17 16 13 R1 C1 21 20 R2 1 1 R1 C1 clock control 2 21 20 1 1 R2 1 C2 3 21 22 20 7 1 R3 4 C3 Instruction for the animator Text to be displayed in the working area (DT) The orange lines should blink once. The registers are clocked in a stop/go fashion using the majority rule. A register is clocked if the clocking bit agrees with the majority bit. 5

3 Step 8: 1 2 4 5 1 1 1 1 1 1 clock control 18 17 16 13 R1 C1 21 20 R2 1 1 R1 C1 clock control 2 21 20 1 1 R2 1 1 C2 3 21 22 20 7 1 R3 4 C3 Instruction for the animator Text to be displayed in the working area (DT) The 3 violet circles in first register and 1 violet circle in second register should blink once. The text in DT should be displayed. After the text in DT green 0 at R1 and green 1 at R2 should appear The LFSRs R1 and R2 are clocked as their clocking bits C1 and C2 agree with the majority of C1, C2 and C3. LFSR R3 is not clocked. When a register is clocked, its taps are XORed together to generate the new LSB. 5

3 Step 9: 1 2 4 5 1 1 1 1 1 1 clock control 18 17 16 13 R1 C1 21 20 R2 1 1 R1 C1 clock control 2 21 20 1 1 R2 1 1 C2 3 21 22 20 7 1 R3 4 C3 Instruction for the animator Text to be displayed in the working area (DT) The figure in step9 should be shown such that the bits (1s and 0s ) are moved to left in R1 and R2. The contents of LFSRs R1 and R2 are left shifted. 5

3 Step 10: 1 2 4 5 1 1 1 1 1 clock control 18 17 16 13 R1 C1 21 20 R2 1 1 R1 C1 clock control 2 21 20 1 1 R2 1 C2 3 21 22 20 7 1 R3 4 C3 Instruction for the animator Text to be displayed in the working area (DT) The figure in step 10 should appear such that the green 1 and 0 are placed in R1 and R2. The new LSBs which were generated prior to left shifting of the registers is stored in the rightmost bit of the left -shifted registers. 5

Master Layout 2 1 Part 1 - Regular operation of A5/1 Part 2 - Operation of initial state generation using session key and publicly known frame number 18 17 16 13 R1 C1 2 21 20 R2 3 C2 21 22 20 7 4 R3 C3 5 The master layout figure should appear first R1, R2, R3 are three linear feedback shift registers Initially all the registers are zeros

Session key + Frame no. - 64 + 22 bits 111110010100010110110001011010101001010101000001110111001010100100111101100011010101 1 18 17 16 13 Step 1: 1 R1 C1 2 21 20 R2 1 3 C2 21 22 20 7 1 4 R3 C3 Instruction for the animator Text to be displayed in the working area (DT) The red 1 in the top bit sequence is placed at all three registers After the 1s are shown blink the 0s in the last boxes of all registers and red 1s The LSB of session key is XORed with the LSB of R1, R2, R3. During the initial state generation the output of the stream cipher is ignored. 5

Session key + Frame no. - 64 + 22 bits 111110010100010110110001011010101001010101000001110111001010100100111101100011010101 1 18 17 16 13 Step 2: 1 R1 C1 2 21 20 R2 1 3 C2 21 22 20 7 4 1 R3 C3 Instruction for the animator Text to be displayed in the working area (DT) The red 1s should be placed in the last boxes of all the registers. The result of XORing is stored in LSBs of all the registers 5

Session key + Frame no. - 64 + 22 bits 111110010100010110110001011010101001010101000001110111001010100100111101100011010101 1 18 17 16 13 Step 3: 1 R1 C1 2 21 20 R2 1 3 C2 21 22 20 7 4 1 R3 C3 Instruction for the animator Text to be displayed in the working area (DT) The small violet circles of first register should blink and the black 0 should appear Then the same for the second register and after for the third register The clocking is done i.e., the XOR of taps of all the registers is done together 5

Session key + Frame no. - 64 + 22 bits 111110010100010110110001011010101001010101000001110111001010100100111101100011010101 1 18 17 16 13 Step 4: 1 R1 C1 2 21 20 R2 1 3 C2 21 22 20 7 4 1 R3 C3 Instruction for the animator Text to be displayed in the working area (DT) The bits should be left shifted and black 0s should be placed in last boxes The bits are left shifted and the new LSB from XORing taps is stored in LSB 5

Session key + Frame no. - 64 + 22 bits 111110010100010110110001011010101001010101000001110111001010100100111101100011010101 1 18 17 16 13 Step 5: 1 1 R1 C1 2 21 20 R2 1 1 3 C2 21 22 20 7 1 4 1 R3 C3 Instruction for the animator Text to be displayed in the working area (DT) The green 1 in the top bit sequence is placed at all three registers When the 1s are shown blink the 0s in the last boxes and green 1s The next bit of session key is XORed with the LSB of R1, R2, R3. 5

Session key + Frame no. - 64 + 22 bits 111110010100010110110001011010101001010101000001110111001010100100111101100011010101 1 18 17 16 13 Step 6: 1 R1 C1 2 21 20 R2 1 C2 21 22 20 7 4 1 R3 C3 Instruction for the animator Text to be displayed in the working area (DT) The green 1s should be placed in the last boxes of all the registers. The result of XOR is stored in LSBs of all the registers 5

Session key + Frame no. - 64 + 22 bits 111110010100010110110001011010101001010101000001110111001010100100111101100011010101 1 18 17 16 13 Step 7: 1 R1 C1 2 21 20 R2 1 3 C2 21 22 20 7 4 1 R3 C3 Instruction for the animator Text to be displayed in the working area (DT) The small violet circles should blink and the black 0s should appear The clocking is done i.e., the XOR of taps of all the registers is done together 5

Session key + Frame no. - 64 + 22 bits 111110010100010110110001011010101001010101000001110111001010100100111101100011010101 18 17 16 13 1 Step 8: 1 R1 C1 2 21 20 R2 1 3 C2 21 22 20 7 1 R3 4 C3 Instruction for the animator Text to be displayed in the working area (DT) The bits should be left shifted and black 0s should be placed in last boxes There should be a next button so that the user can complete the process for 86 times. The bits are left shifted and the result of XORed taps is stored in LSB This process is continued for 86 cycles with regular clocking The contents of the registers after 86 cycles is called the initial state of the frame After this, the registers are clocked for 100cycles with irregular clocking 5

Questionnaire 1 1. If the registers R1, R2 and R3 have clocking bits as 1,1,1, then which registers will be clocked? Answers: a) R1 b) R2 c) R3 d)‏R1, R2, R3 2. If the registers R1, R2 and R3 have clocking bits as 1,0,0, then which registers will be clocked? Answers: a)R1 b)R1, R2 c) R2, R3 d)‏ R1, R2, R3 3. The minimum number of registers which are clocked at a time _______ Answers: a) 0 b) 1 c) 2 d)‏ 3 The answers are given in red 2 3 4 5

Links for further reading Reference websites: http://en.wikipedia.org/wiki/A5/1 http://www.scard.org/gsm/a51.html http://cryptome.org/a51-bsw.htm Books: Mobile Communication Systems and Security – Man Young Rhee, John Wiley & Sons(April 2009, Wiley-ieee Press) Research papers:

Summary A5/1 is a stream cipher used to provide over-the-air communication privacy in the GSM cellular telephone standard A5/1 is built from three short linear feedback shift registers (LFSR) of lengths 19, 22, and 23 bits, which are denoted by R1, R2 and R3 When a register is clocked, its taps are XORed together and the result is stored in the rightmost bit of the left-shifted register They are clocked in a stop/go fashion using the majority rule At each step either two or three registers are clocked