Introduction to Information Security
|
|
- Justin Simon
- 5 years ago
- Views:
Transcription
1 Introuction to Inforation Security Lecture : Classical Ciphers Prof. Byoungcheon Lee sultan (at) joongbu. ac. kr Inforation an Counications University
2 Contents 1. History of cryptographic research. Substitution ciphers Caesar ciphers Affine ciphers Monoalphabetic substitution cipher Hoophonic substitution cipher Polyalphabetic substitution cipher Vigenere cipher Hill cipher One-tie pa 3. Transposition ciphers Transposition cipher scytale cipher 4. Prouct ciphers
3 1. History of Cryptologic Research 3
4 History of Cryptologic Research 1900BC : Non-stanar hieroglyphics 1500BC : Mesopotaian pottery glazes 50BC : Caesar cipher 1518 : Tritheius cipher book 1558 : Keys invente 1583 : Vigenere s book 1790 : Jefferson wheel 1854 : Playfair cipher 1857 : Beaufort s cipher 1917 : Friean s Riverbank Labs 1917 : Verna one-tie pas 4
5 History of Cryptologic Research 1919 : Hegelin achines 191 : Hebern achines 199 : Hill cipher 1973 : Feistel networks 1976 : Public key cryptography 1979 : Secret sharing 1985 : Zero knowlege 1990 : Differential cryptanalysis 1994 : Linear cryptanalysis 1997 : Triple-DES 1998 ~ 001 : AES 5
6 History of Cryptologic Research Perio Features Exaples Manual Crypto ancient ~ 190 Substitution Transposition Scytale Caesar Vigenere Beaufort (USA) Machine Crypto 190 ~ 1950 Using coplex achine Eniga (Gerany in n WW) M-09 (USA in n WW) Moern Crypto Coputer Crypto 1950 ~ current Using coputer Shannon s theory DES SEED AES RSA ECC KCDSA 6
7 Using Cryptologic Technology Before oern crypto : liite usage National security iploatic war Use by liite people Researche by liite people Current crypto : wiely open stanarize coerce Internet e-coerce Anyboy is using Research an evelopent by anyone 7
8 Scytale a s b c c y t e a f l g e as bc cy t ea fl ge 8
9 Eniga 9
10 Lorenz SZ4 Cipher Machine 10
11 Classical Encryption Techniques Basic builing blocks of all encryption techniques Substitution: replaceent Transposition: relocation Substitution ciphers Caesar cipher Monoalphabetic ciphers Playfair cipher Hill cipher Polyalphabetic ciphers: Vigenere cipher Verna cipher/one-tie pa: perfect cipher Transposition techniques Rotor achines: Eniga Purple 11
12 . Substitution Cipher Caesar ciphers Affine ciphers Hill cipher Monoalphabetic substitution cipher Hoophonic substitution cipher Polyalphabetic substitution cipher Vigenere cipher One-tie pa 1
13 Caesar Ciphers Julius Caesar the Roan eperor Also known as shift cipher Matheatically assign nubers to each alphabet a b c e f g h i j k... z Caesar cipher : C = E K (M) = M + K o 6 K = 3 M = D K (C) = C - K o 6 K = 3 13
14 Caesar Ciphers Define transforation as: a b c e f g h i j k... z D E F G H I J K L M N C Encryption exaple i n f o r a t i o n L Q I R U P D W L R Q Weakness Key space is too short only 6 possible keys Brute force search Exaple: Break ciphertext L ORYH LFX" 14
15 Affine Ciphers Generalization of Caesar cipher Encryption C E K gc( K 1 ( M ) K M 6) 1 1 K o 6 Decryption M D K ( C) ( C K ) K 1 1 o 6 Exaple: ecrypt the following ciphertext WZDUY ZZYQB OTHTX ZDNZD KWQHI BYQBP WZDUY ZXZDSS How? Using English character frequency analysis 15
16 English Character Frequencies Letter Frequency(%) Letter Frequency(%) Letter Frequency(%) e p 1.9 t 9.1 l 4.0 b 1.5 a 8. c.8 v 1.0 o 7.5 u.8 k 0.8 i j 0. n 6.7 w.3 x 0.1 s 6.3 f. q 0.1 h 6.1 g.0 z 0.1 r 6.0 y.0 (1) Pr(e)=0.1 () Pr(taoinshr) = 0.06 ~0.09 (3) Pr(l)=0.04 (4) Pr(cuwfgypb)= 0.015~0.03 (5) Pr(vkjxqz) <=
17 Affine Ciphers Z occurs 8 ties ETAOI??? D occurs 5 ties ETAOI??? Y occurs 4 ties ETAOI??? WQB occur 3 ties ETAOI??? Z E D T : try to solve 5 4K 3 19K K K K K 17 o 6 o 6 reject Try possible solutions until you get eaningful plaintext Exercise: try yourself 17
18 Hill Cipher e K (x) : (y 1 y y ) =(x 1 x x ) K where K is x atrix an gc(et K 6) =1 K (y) = y K -1 (Ex) K = 11 8 K -1 = x : july (ju)= (90) (ly) = (114) (90) K = (34) = (DE) (114) K = (11) = (LW) 18
19 Monoalphabetic Substitution Ciphers Exaple : 1-1 Substitution rule a b c e f g h i j k l n o p q r s t u v w x y z E G L T B N M Q P A O W C R X H I Y Z D S F J K U V Exaple : Encryption i n f o r a t i o n P R N X Y C E D P X R Key space : 6! Cryptanalysis: Using English character frequency analysis 19
20 Hoophonic Substitution Ciphers Letters which occur frequently ay be appe into ore than one letter in the ciphertext to flatten the frequency istribution. Alphabet is appe into the nubers 0 to 99 For exaple E(1.7%) A(8.%) R(6.0%) T(9.1%)
21 1 Polyalphabetic Substitution Ciphers Hie the frequency istribution by aking ultiple substitutions. Apply ifferent perutations. ) ( ) ( ) ( ) ( ) ( ) ( ) ( K E Vigenere cipher Beaufor cipher
22 Polyalphabetic Substitution Ciphers Vigenère Ciphers Multiple caesar cipher i k c c c c D i k c c c E c k k k k k i i k i i k 1 for o 6 ) ( ) ( 1 for o 6 ) ( ) ( 6 ) ( i c k c c c D i k c c c E c k k k k k i i k i i k 1 for o 6 ) ( ) ( 1 for o 6 ) ( ) ( 6 ) ( Beaufor ciphers (use in US civil war)
23 Vigenère Ciphers Look-up table for Vigenère Ciphers 평문 a b c e f g h i j k l n o p q r s t u v w x y z 키워드 A A B C D E F G H I J K L M N O P Q R S T U V W X Y Z B B C D E F G H I J K L M N O P Q R S T U V W X Y Z A C C D E F G H I J K L M N O P Q R S T U V W X Y Z A B D D E F G H I J K L M N O P Q R S T U V W X Y Z A B C E E F G H I J K L M N O P Q R S T U V W X Y Z A B C D F F G H I J K L M N O P Q R S T U V W X Y Z A B C D E G G H I J K L M N O P Q R S T U V W X Y Z A B C D E F H H I J K L M N O P Q R S T U V W X Y Z A B C D E F G I I J K L M N O P Q R S T U V W X Y Z A B C D E F G H J J K L M N O P Q R S T U V W X Y Z A B C D E F G H I K K L M N O P Q R S T U V W X Y Z A B C D E F G H I J L L M N O P Q R S T U V W X Y Z A B C D E F G H I J K M M N O P Q R S T U V W X Y Z A B C D E F G H I J K L N N O P Q R S T U V W X Y Z A B C D E F G H I J K L M O O P Q R S T U V W X Y Z A B C D E F G H I J K L M N P P Q R S T U V W X Y Z A B C D E F G H I J K L M N O Q Q R S T U V W X Y Z A B C D E F G H I J K L M N O P R R S T U V W X Y Z A B C D E F G H I J K L M N O P Q S S T U V W X Y Z A B C D E F G H I J K L M N O P Q R T T U V W X Y Z A B C D E F G H I J K L M N O P Q R S U U V W X Y Z A B C D E F G H I J K L M N O P Q R S T V V W X Y Z A B C D E F G H I J K L M N O P Q R S T U W W X Y Z A B C D E F G H I J K L M N O P Q R S T U V X X Y Z A B C D E F G H I J K L M N O P Q R S T U V W Y Y Z A B C D E F G H I J K L M N O P Q R S T U V W X Z Z A B C D E F G H I J K L M N O P Q R S T U V W X Y 3
24 Vigenère Ciphers Plaintext Keywor Ciphertext t h i s c r y p t o s y s t e i s n o t s e c S E C U R I T Y S E C U R I T Y S E C U R I T Y L L K M T Z R N L S U S J B X K A W P I K A X A M V G u S r E e C 4
25 Polyalphabetic Substitution Ciphers Cryptanalysis of polyalphabetic substitution ciphers 1. Deterine the perio. Deterine each substitution keys How to eterine the perio? 1. Kasiski etho : use repetitions in the ciphertext. Inex of coincience by Friean: copute the inex of coincience an estiate the perio Refer to 5
26 Kasiski Metho Exaple: Vigenère Ciphers key: eceptiveeceptiveeceptive plaintext: weareiscoveresaveyourself ciphertext:zicvtwqngrzgvtwavzhcqyglmgj Metho evelope by Kasiski Letter groups in ciphertext are repeate because repeate letter groups in the plaintext line up with the keywor. If letter groups repeate in ciphertext then keywor length ay be a ivisor of their separations. - in this exaple VTW is repeate in 9 letters apart - suggests size of is 3 or 9 6
27 Inex of Coincience The inex of coincience for a (cipher)text is the probability that two letters selecte fro it are ientical. It is enote I. 7
28 Inex of Coincience For a typical English ocuent I=
29 Inex of Coincience For a ranoize (ieally encrypte) ocuent I=
30 Inex of Coincience We can estiate the keywor length using the inex of coincience. k : Estiate keywor length 30
31 Inex of Coincience We can estiate the keywor length using the inex of coincience. 31
32 Inex of Coincience Exaple: Estiate the keywor length of the following istribution in ciphertext Estiate keywor length is 5 3
33 One-tie Pa (Verna cipher) Use a rano key as long as the essage size an use the key only once Unbreakable Since ciphertext bears no statistical relationship to the plaintext Since for any plaintext & any ciphertext there exists a key apping one to other Have the proble of safe istribution of key Ex) Binary alphabet P : o n e t i P : K : C : Perfect Cipher : p (x y) = p(x) for all x P y C Ipossible COA 33
34 3. Transposition Ciphers Transposition cipher Scytale cipher Rotor achines 34
35 Transposition Ciphers Rearrange characters of plaintext to prouce ciphertext Frequency istribution of the characters is not change by encryption Exaple: Encryption perutation Decryption perutation plaintext ciphertext i n f o r a t i o n s e c u r i t y x y z a b F R I M O N I N A S O T U I E T R C Y A Y B Z X 35
36 Transposition Ciphers Cryptanalysis : Perio is guesse by trying possible perios A knowlege of the ost frequent pairs an triples in a language is use with anagraing. Use language characteristics Frequent pairs on a relative scale to 10 TH : HE : 9.50 IN : 7.17 ER : 6.65 RE : 5.9 Frequent triples on a relative scale to 10 THE : AND :.81 TIO :.4 ATI : 1.67 Exercise: ecrypt the following ciphertext LDWEOHETTHSESTRUHTELOBSEDEFEIVNT 36
37 Scytale Cipher a s b c c y t e a f l g e as bc cy t ea fl ge 37
38 4. Prouct Ciphers ADFGVX Shannon SP Network 38
39 ADFGVX Prouct of substitution an perutation Substitution table Substitution result A D F G V X A f x a 9 u 1 D n g 0 l o F 5 b k h z G j s y t v V e 8 i X c w q 6 r p c o n v e n t i o n a l X A D X D A G X V G D A c r y p t o g r a p h y X A X V G G X X G V D X G V D D V X X V D X A F D A X X A F F V D G G G c XA 39
40 ADFGVX Perutation table Ciphertext C I P H E R X A D X D A G X V G D A G V V X D X D A A F D G X A X V G G X X G V D X D D X V A F X X F V G G Keywor perutation XGGDXXDX DDDDGDAG XGXFVVVV AXVAAXDX DVVAXGXF AAXGFXFG 40
41 Shannon s Proposal C. Shannon Counication Theory for Secrecy Systes 1949 Copose ifferent kin of siple an insecure ciphers to create coplex an secure cryptosystes calle prouct cipher Incorporate confusion an iffusion Substitution-Perutation Network Claue Shannon 41
42 Confusion an Diffusion Confusion (substitution) : The ciphertext statistics shoul epen on the plaintext statistics in a anner too coplicate to be exploite by the eney cryptanalyst Makes relationship between ciphertext an key as coplex as possible Diffusion (perutation) : Each igit of the plaintext shoul influence any igits of the ciphertext an/or Each igit of the secret key shoul influence any igits of the the ciphertext. Dissipates statistical structure of plaintext over bulk of ciphertext 4
43 SP Network Substitution-Perutation network Substitution (S-box) : secret key is use Perutation (P-box) : no secret key fixe topology Provie confusion an iffusion S-P networks are expecte to have Avalanche property: a single input bit change shoul force the copleentation of approxiately half of the output bits Copleteness property: each output bit shoul be a coplex function of every input bits Theoretical basis of oern block ciphers 43
44 SP Network 44
45 Kerckhoff s Principle Auguste Kerckhoff 1883 A cryptosyste shoul be secure even if everything about the syste except the key is public knowlege. Eric Rayon extens this principle in support of open source software saying "Any security software esign that oesn't assue the eney possesses the source coe is alreay untrustworthy; therefore never trust close source. The ajority of civilian cryptography akes use of publiclyknown algoriths. By contrast ciphers use to protect classifie governent or ilitary inforation are often kept secret 45
46 Hoework # 1. Design an ipleent a C progra for encryption ecryption an cryptanalysis of the affine cipher. For the cryptanalysis your progra ust not use the enueration of all possible keys but shoul use the frequency of characters to ake optial guesses about the key.. Decryption of Vigenère Ciphers. Solve the proble 9 in page 61 of the textbook. 46
Week 3 :Classical & Mechanical Ciphers. When and how long it was begun? Why?
Wee 3 :Classial & Mehanial Ciphers When an how long it was begun? Why? History of Cryptologi Researh/3) 900BC : Non-stanar hieroglyphis 500BC : Mesopotaian pottery glazes 50BC : Caesar ipher 58 : Tritheius
More informationGoals of Cryptography. Definition of a Cryptosystem. Security Kerckhoff's Requirements
Goals of Cryptography Chapter : Security Techniques Background Secret Key Cryptography Public Key Cryptography Hash Functions Authentication Chapter 3: Security on Network Transport Layer Chapter 4: Security
More informationFinal Exam Math 105: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 30 April :30 11:00 a.m.
Final Exam Math 10: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 0 April 2002 :0 11:00 a.m. Instructions: Please be as neat as possible (use a pencil), and show
More informationCSCI3381-Cryptography
CSCI3381-Cryptography Lecture 2: Classical Cryptosystems September 3, 2014 This describes some cryptographic systems in use before the advent of computers. All of these methods are quite insecure, from
More informationLecture (04) Classical Encryption Techniques (III)
Lecture (04) Classical Encryption Techniques (III) Dr. Ahmed M. ElShafee ١ Playfair Cipher one approach to improve security was to encrypt multiple letters the Playfair Cipher is an example invented by
More informationone approach to improve security was to encrypt multiple letters invented by Charles Wheatstone in 1854, but named after his
Lecture (04) Classical Encryption Techniques (III) Dr. Ahmed M. ElShafee ١ The rules for filling in this 5x5 matrix are: L to R, top to bottom, first with keyword after duplicate letters have been removed,
More informationCryptography CS 555. Topic 2: Evolution of Classical Cryptography CS555. Topic 2 1
Cryptography CS 555 Topic 2: Evolution of Classical Cryptography Topic 2 1 Lecture Outline Basics of probability Vigenere cipher. Attacks on Vigenere: Kasisky Test and Index of Coincidence Cipher machines:
More informationmonoalphabetic cryptanalysis Character Frequencies (English) Security in Computing Common English Digrams and Trigrams Chapter 2
Common English Digrams and Trigrams Digrams EN RE ER NT TH ON IN TF AN OR Trigrams ENT ION AND ING IVE TIO FOR OUR THI ONE monoalphabetic cryptanalysis See class example Pfleeger, Security in Computing,
More informationIntroduction to Cryptology. Lecture 2
Introduction to Cryptology Lecture 2 Announcements 2 nd vs. 1 st edition of textbook HW1 due Tuesday 2/9 Readings/quizzes (on Canvas) due Friday 2/12 Agenda Last time Historical ciphers and their cryptanalysis
More informationData and information security: 2. Classical cryptography
ICS 423: s Data and information security: 2. Classical cryptography UHM ICS 423 Fall 2014 Outline ICS 423: s s and crypto systems ciphers ciphers Breaking ciphers What did we learn? Outline ICS 423: s
More informationCook-Levin Theorem. SAT is NP-complete
Cook-Levin Theorem SAT is NP-complete In other words SAT NP A NP A P SAT 1 Consider any A NP NTM N that decides A in polytime n k For any input w Σ * valid tableau of configurations 2 Properties of an
More informationTHE UNIVERSITY OF CALGARY FACULTY OF SCIENCE DEPARTMENT OF COMPUTER SCIENCE DEPARTMENT OF MATHEMATICS & STATISTICS MIDTERM EXAMINATION 1 FALL 2018
THE UNIVERSITY OF CALGARY FACULTY OF SCIENCE DEPARTMENT OF COMPUTER SCIENCE DEPARTMENT OF MATHEMATICS & STATISTICS MIDTERM EXAMINATION 1 FALL 2018 CPSC 418/MATH 318 L01 October 17, 2018 Time: 50 minutes
More informationCOS433/Math 473: Cryptography. Mark Zhandry Princeton University Spring 2017
COS433/Math 473: Cryptography Mark Zhandry Princeton University Spring 2017 Previously on COS 433 Pre- modern Cryptography 1900 B.C. mid 1900 s A.D With few exceptions, synonymous with encryption c = Enc(k,m)
More informationIntroduction to Cryptography
T H E U N I V E R S I T Y O F B R I T I S H C O L U M B I A Introduction to Cryptography EECE 412 1 Module Outline Historical background Classic ciphers One-time pad The Random Oracle model Random functions:
More informationCiphers: Making and Breaking
Ciphers: Making and Breaking Ralph Morelli Trinity College, Hartford (ralph.morelli@trincoll.edu) Smithsonian Institute October 31, 2009 2009 Ralph Morelli You are free to reuse and remix this presentation
More informationShift Cipher. For 0 i 25, the ith plaintext character is. E.g. k = 3
Shift Cipher For 0 i 25, the ith plaintext character is shifted by some value 0 k 25 (mod 26). E.g. k = 3 a b c d e f g h i j k l m n o p q r s t u v w x y z D E F G H I J K L M N O P Q R S T U V W X Y
More informationClassical Cryptography
Classical Cryptography CSG 252 Fall 2006 Riccardo Pucella Goals of Cryptography Alice wants to send message X to Bob Oscar is on the wire, listening to communications Alice and Bob share a key K Alice
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-27 Recap ADFGX Cipher Block Cipher Modes of Operation Hill Cipher Inverting a Matrix (mod n) Encryption: Hill Cipher Example Multiple
More information... Assignment 3 - Cryptography. Information & Communication Security (WS 2018/19) Abtin Shahkarami, M.Sc.
Assignment 3 - Cryptography Information & Communication Security (WS 2018/19) Abtin Shahkarami, M.Sc. Deutsche Telekom Chair of Mobile Business & Multilateral Security Goethe-University Frankfurt a. M.
More informationSound approaches to cryptography
CHAPTER 4: CLASSICAL (SECRET-KEY) CRYPTOSYSTEMS Part IV Secret-key cryptosystems In this chapter we deal with some of the very old, or quite old, classical (secret-key or symmetric) cryptosystems that
More informationCryptography. Lecture 2: Perfect Secrecy and its Limitations. Gil Segev
Cryptography Lecture 2: Perfect Secrecy and its Limitations Gil Segev Last Week Symmetric-key encryption (KeyGen, Enc, Dec) Historical ciphers that are completely broken The basic principles of modern
More informationChapter 2 Classical Cryptosystems
Chapter 2 Classical Cryptosystems Note We will use the convention that plaintext will be lowercase and ciphertext will be in all capitals. 2.1 Shift Ciphers The idea of the Caesar cipher: To encrypt, shift
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 3 January 22, 2013 CPSC 467b, Lecture 3 1/35 Perfect secrecy Caesar cipher Loss of perfection Classical ciphers One-time pad Affine
More information5. Classical Cryptographic Techniques from modular arithmetic perspective
. Classical Cryptographic Techniques from modular arithmetic perspective By classical cryptography we mean methods of encipherment that have been used from antiquity through the middle of the twentieth
More informationCPE 776:DATA SECURITY & CRYPTOGRAPHY. Some Number Theory and Classical Crypto Systems
CPE 776:DATA SECURITY & CRYPTOGRAPHY Some Number Theory and Classical Crypto Systems Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan Some Number Theory
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-22 Recap Two methods for attacking the Vigenère cipher Frequency analysis Dot Product Playfair Cipher Classical Cryptosystems - Section
More informationSimple Codes MTH 440
Simple Codes MTH 440 Not all codes are for the purpose of secrecy Morse Code ASCII Zip codes Area codes Library book codes Credit Cards ASCII Code Steganography: Hidden in plain sight (example from http://www.bbc.co.uk/news/10
More information1/16 2/17 3/17 4/7 5/10 6/14 7/19 % Please do not write in the spaces above.
1/16 2/17 3/17 4/7 5/10 6/14 7/19 % Please do not write in the spaces above. Directions: You have 75 minutes in which to complete this exam. Please make sure that you read through this entire exam before
More informationCryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 08 Shannon s Theory (Contd.)
More informationPEA: Polymorphic Encryption Algorithm based on quantum computation. Nikos Komninos* and Georgios Mantas
Int. J. Systes, Control and Counications, Vol. 3, No., PEA: Polyorphic Encryption Algorith based on quantu coputation Nikos Koninos* and Georgios Mantas Algoriths and Security Group, Athens Inforation
More informationCryptography. P. Danziger. Transmit...Bob...
10.4 Cryptography P. Danziger 1 Cipher Schemes A cryptographic scheme is an example of a code. The special requirement is that the encoded message be difficult to retrieve without some special piece of
More informationCryptography Lecture 4 Block ciphers, DES, breaking DES
Cryptography Lecture 4 Block ciphers, DES, breaking DES Breaking a cipher Eavesdropper recieves n cryptograms created from n plaintexts in sequence, using the same key Redundancy exists in the messages
More informationSol: First, calculate the number of integers which are relative prime with = (1 1 7 ) (1 1 3 ) = = 2268
ò{çd@àt ø 2005.0.3. Suppose the plaintext alphabets include a z, A Z, 0 9, and the space character, therefore, we work on 63 instead of 26 for an affine cipher. How many keys are possible? What if we add
More informationMATH3302 Cryptography Problem Set 2
MATH3302 Cryptography Problem Set 2 These questions are based on the material in Section 4: Shannon s Theory, Section 5: Modern Cryptography, Section 6: The Data Encryption Standard, Section 7: International
More informationUniversity of Regina Department of Mathematics & Statistics Final Examination (April 21, 2009)
Make sure that this examination has 10 numbered pages University of Regina Department of Mathematics & Statistics Final Examination 200910 (April 21, 2009) Mathematics 124 The Art and Science of Secret
More informationPolyalphabetic Ciphers
Polyalphabetic Ciphers 1 Basic Idea: The substitution alphabet used for enciphering successive letters of plaintext changes. The selection of alphabets may depend on a keyword, a key stream, or electromechanical
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationComputer Security. 07. Cryptography. Paul Krzyzanowski. Rutgers University. Spring 2018
Computer Security 07. Cryptography Paul Krzyzanowski Rutgers University Spring 2018 March 20, 2018 CS 419 2018 Paul Krzyzanowski 1 cryptography κρυπός γραφία hidden writing A secret manner of writing,
More informationLecture 12: Block ciphers
Lecture 12: Block ciphers Thomas Johansson T. Johansson (Lund University) 1 / 19 Block ciphers A block cipher encrypts a block of plaintext bits x to a block of ciphertext bits y. The transformation is
More informationCristina Nita-Rotaru. CS355: Cryptography. Lecture 4: Enigma.
CS355: Cryptography Lecture 4: Enigma. Towards cryptographic engines } How to move from pencil and paper to more automatic ways of encrypting and decrypting? } How to design more secure ciphers } Alberti
More informationDistributed Lossy Averaging
Distribute Lossy Averaging Han-I Su Departent of Electrical Engineering Stanfor University Stanfor, CA 94305, USA Eail: hanisu@stanforeu Abbas El Gaal Departent of Electrical Engineering Stanfor University
More informationLecture 8 - Cryptography and Information Theory
Lecture 8 - Cryptography and Information Theory Jan Bouda FI MU April 22, 2010 Jan Bouda (FI MU) Lecture 8 - Cryptography and Information Theory April 22, 2010 1 / 25 Part I Cryptosystem Jan Bouda (FI
More informationThe Evolution of Cryptology
California State University, San Bernardino CSUSB ScholarWorks Electronic Theses, Projects, and Dissertations Office of Graduate Studies 6-2016 The Evolution of Cryptology Gwendolyn Rae Souza California
More informationEfficient Cryptanalysis of Homophonic Substitution Ciphers
Efficient Cryptanalysis of Homophonic Substitution Ciphers Amrapali Dhavare Richard M. Low Mark Stamp Abstract Substitution ciphers are among the earliest methods of encryption. Examples of classic substitution
More informationInnovation and Cryptoventures. Cryptology. Campbell R. Harvey. Duke University, NBER and Investment Strategy Advisor, Man Group, plc.
Innovation and Cryptoventures Cryptology Campbell R. Harvey Duke University, NBER and Investment Strategy Advisor, Man Group, plc January 20, 2017 Overview Cryptology Cryptography Cryptanalysis Symmetric
More informationDESIGN OF FIR FILTERS WITH ARBITRARY RESPONSES
M.Tech. creit seinar report, Electronic Systes Group, EE Dept, IIT Bobay, subitte Noveber 004 DESIGN OF FIR FILTERS WITH ARBITRARY RESPONSES N. V. Murali (Roll No. 0430704) Supervisor: Prof. P. C. Paney
More informationClassical Cryptography
JASS 05 Seminar: Algorithms for IT Security Classical Cryptography Ilya Saverchenko June 6, 2005 Abstract Cryptography is a study of secret writing. It allows two people, usually referred to as Alice and
More informations = (Y Q Y P)/(X Q - X P)
Elliptic Curves and their Applications in Cryptography Preeti Shara M.Tech Student Mody University of Science and Technology, Lakshangarh Abstract This paper gives an introduction to elliptic curves. The
More informationPolybius s square. History ancient Greece. Short history. Polybius, Ancient Greece : communication with torches
CRYPTOLOGY : CRYPTOGRAPHY + CRYPTANALYSIS Polybius s square Cryptology = science of secrecy. How : encipher a plaintext into a ciphertext to protect its secrecy. The recipient deciphers the ciphertext
More informationJay Daigle Occidental College Math 401: Cryptology
3 Block Ciphers Every encryption method we ve studied so far has been a substitution cipher: that is, each letter is replaced by exactly one other letter. In fact, we ve studied stream ciphers, which produce
More informationThe Vigenère cipher is a stronger version of the Caesar cipher The encryption key is a word/sentence/random text ( and )
A Better Cipher The Vigenère cipher is a stronger version of the Caesar cipher The encryption key is a word/sentence/random text ( and ) To the first letter, add 1 To the second letter, add 14 To the third
More informationParallel stream cipher for secure high-speed communications
Signal Processing 82 (2002 259 265 www.elsevier.co/locate/sigpro Parallel strea cipher for secure high-speed counications Hoonjae Lee a;, Sangjae Moon b a Departent of Coputer Engineering, Kyungwoon University,
More informationA Large Block Cipher using an Iterative Method and the Modular Arithmetic Inverse of a key Matrix
A Large Block Cipher using an Iterative Method and the Modular Arithmetic Inverse of a key Matrix S. Udaya Kumar V. U. K. Sastry A. Vinaya babu Abstract In this paper, we have developed a block cipher
More informationMultiple Testing Issues & K-Means Clustering. Definitions related to the significance level (or type I error) of multiple tests
StatsM254 Statistical Methods in Coputational Biology Lecture 3-04/08/204 Multiple Testing Issues & K-Means Clustering Lecturer: Jingyi Jessica Li Scribe: Arturo Rairez Multiple Testing Issues When trying
More informationPowers in Modular Arithmetic, and RSA Public Key Cryptography
1 Powers in Modular Arithmetic, and RSA Public Key Cryptography Lecture notes for Access 2006, by Nick Korevaar. It was a long time from Mary Queen of Scotts and substitution ciphers until the end of the
More informationThe Web Cryptology Game CODEBREAKERS.EU edition 2015
Lecture 5 in which we return to the dream about le chiffre indechiffrable. We will see this dream come true and next we will try, step by step, to break this unbreakable cipher. As you might remember,
More informationThe simplest method for constructing APN polynomials EA-inequivalent to power functions
The siplest ethod for constructing APN polynoials EA-inequivalent to power functions Lilya Budaghyan Abstract The first APN polynoials EA-inequivalent to power functions have been constructed in [7, 8]
More informationCODING AND CRYPTOLOGY III CRYPTOLOGY EXERCISES. The questions with a * are extension questions, and will not be included in the assignment.
CODING AND CRYPTOLOGY III CRYPTOLOGY EXERCISES A selection of the following questions will be chosen by the lecturer to form the Cryptology Assignment. The Cryptology Assignment is due by 5pm Sunday 1
More informationA Block Cipher using an Iterative Method involving a Permutation
Journal of Discrete Mathematical Sciences & Cryptography Vol. 18 (015), No. 3, pp. 75 9 DOI : 10.1080/097059.014.96853 A Block Cipher using an Iterative Method involving a Permutation Lakshmi Bhavani Madhuri
More informationComputer Security. 07. Cryptography. Paul Krzyzanowski. Rutgers University. Spring 2017
Computer Security 07. Cryptography Paul Krzyzanowski Rutgers University Spring 2017 March 26, 2017 CS 419 2017 Paul Krzyzanowski 1 cryptography κρυπός γραφία hidden writing A secret manner of writing,
More informationQuantum public-key cryptosystems based on induced trapdoor one-way transformations
Quantu public-key cryptosystes based on induced trapdoor one-way transforations Li Yang a, Min Liang a, Bao Li a, Lei Hu a, Deng-Guo Feng b arxiv:1012.5249v2 [quant-ph] 12 Jul 2011 a State Key Laboratory
More informationElliptic Curve Scalar Point Multiplication Algorithm Using Radix-4 Booth s Algorithm
Elliptic Curve Scalar Multiplication Algorith Using Radix-4 Booth s Algorith Elliptic Curve Scalar Multiplication Algorith Using Radix-4 Booth s Algorith Sangook Moon, Non-eber ABSTRACT The ain back-bone
More informationA Link Between Integrals and Higher-Order Integrals of SPN Ciphers
Link Between Integrals and Higher-Order Integrals of SPN Ciphers Ruilin Li, Bing Sun, and Chao Li Integral cryptanalysis, which is based on the existence of (higher-order) integral distinguishers, is a
More informationCHAPTER 5 A BLOCK CIPHER INVOLVING A KEY APPLIED ON BOTH THE SIDES OF THE PLAINTEXT
82 CHAPTER 5 A BLOCK CIPHER INVOLVING A KEY APPLIED ON BOTH THE SIDES OF THE PLAINTEXT 83 5.1 Introduction In a pioneering paper, Hill [5] developed a block cipher by using the modular arithmetic inverse
More informationClock Arithmetic and Euclid s Algorithm
Clock Arithmetic and Euclid s Algorithm Lecture notes for Access 2008 by Erin Chamberlain. Earlier we discussed Caesar Shifts and other substitution ciphers, and we saw how easy it was to break these ciphers
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More information1999 version 2001 simplified version
香港中文大學讀書會 1999 version 2001 simplified version Author Simon Singh http://simonsingh.net/ 1. Fermat s Last Theorem the epic quest to Solve the World's Greatest Mathematical Problem(2007) 2. The Code Book(1999)
More informationMaximum a Posteriori Decoding of Turbo Codes
Maxiu a Posteriori Decoing of Turbo Coes by Bernar Slar Introuction The process of turbo-coe ecoing starts with the foration of a posteriori probabilities (APPs) for each ata bit, which is followe by choosing
More informationJournal of Babylon University/Pure and Applied Sciences/ No.(3)/ Vol.(22): 2014
Journal of Babylon University/Pure and Applied Sciences/ No.(3)/ Vol.(): 014 A Study of Different Complexity Evaluation Approaches for Some Cryptosystems Sabiha F. Jawad Al-Mustansyria University Iraq-
More informationBlock Ciphers and Feistel cipher
introduction Lecture (07) Block Ciphers and cipher Dr. Ahmed M. ElShafee Modern block ciphers are widely used to provide encryption of quantities of information, and/or a cryptographic checksum to ensure
More informationPolyalphabetic Substitutions
Polyalphabetic Substitutions Klaus Pommerening Fachbereich Physik, Mathematik, Informatik der Johannes-Gutenberg-Universität Saarstraße 21 D-55099 Mainz October 25, 1999 English version October 13, 2013
More informationPublic-key Cryptography and elliptic curves
Public-key Cryptography and elliptic curves Dan Nichols University of Massachusetts Amherst nichols@math.umass.edu WINRS Research Symposium Brown University March 4, 2017 Cryptography basics Cryptography
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationIntroduction to Cryptographic Engineering. Steven M. Bellovin
Introduction to Cryptographic Engineering Steven M. Bellovin https://www.cs.columbia.edu/~smb 1 Cryptographic Engineering? There are lots of introductions to encryption But using encryption in the real
More informationNumber Theory in Cryptography
Number Theory in Cryptography Introduction September 20, 2006 Universidad de los Andes 1 Guessing Numbers 2 Guessing Numbers (person x) (last 6 digits of phone number of x) 3 Guessing Numbers (person x)
More informationLecture 5: Logspace reductions and completeness
Coputational Coplexity Theory, Fall 2010 Septeber 8 Lecture 5: Logspace reductions and copleteness Lecturer: Kristoffer Arnsfelt Hansen Scribe: Claes Højer Jensen Recall the given relation between classes:
More informationESE 523 Information Theory
ESE 53 Inforation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electrical and Systes Engineering Washington University 11 Urbauer Hall 10E Green Hall 314-935-4173 (Lynda Marha Answers) jao@wustl.edu
More informationCryptanalysis. A walk through time. Arka Rai Choudhuri
Cryptanalysis A walk through time Arka Rai Choudhuri arkarai.choudhuri@gmail.com How many can you identify? History (or how I will give you hope of becoming world famous and earning $70 million along
More informationOutline. Computer Science 418. Number of Keys in the Sum. More on Perfect Secrecy, One-Time Pad, Entropy. Mike Jacobson. Week 3
Outline Computer Science 48 More on Perfect Secrecy, One-Time Pad, Mike Jacobson Department of Computer Science University of Calgary Week 3 2 3 Mike Jacobson (University of Calgary) Computer Science 48
More informationExplicit Approximate Solution for Finding the. Natural Frequency of the Motion of Pendulum. by Using the HAM
Applied Matheatical Sciences Vol. 3 9 no. 1 13-13 Explicit Approxiate Solution for Finding the Natural Frequency of the Motion of Pendulu by Using the HAM Ahad Doosthoseini * Mechanical Engineering Departent
More informationDan Boneh. Introduction. Course Overview
Online Cryptography Course Introduction Course Overview Welcome Course objectives: Learn how crypto primitives work Learn how to use them correctly and reason about security My recommendations: Take notes
More informationCristina Nita-Rotaru. CS355: Cryptography. Lecture 9: Encryption modes. AES
CS355: Cryptography Lecture 9: Encryption modes. AES Encryption modes: ECB } Message is broken into independent blocks of block_size bits; } Electronic Code Book (ECB): each block encrypted separately.
More informationPublic-key Cryptography and elliptic curves
Public-key Cryptography and elliptic curves Dan Nichols nichols@math.umass.edu University of Massachusetts Oct. 14, 2015 Cryptography basics Cryptography is the study of secure communications. Here are
More informationCryptography. pieces from work by Gordon Royle
Cryptography pieces from work by Gordon Royle The set-up Cryptography is the mathematics of devising secure communication systems, whereas cryptanalysis is the mathematics of breaking such systems. We
More informationMultivariate Methods. Matlab Example. Principal Components Analysis -- PCA
Multivariate Methos Xiaoun Qi Principal Coponents Analysis -- PCA he PCA etho generates a new set of variables, calle principal coponents Each principal coponent is a linear cobination of the original
More information2.1 Plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm.
CHAPTER 2 CLASSICAL ENCRYPTION TECHNIQUES ANSWERS TO QUESTIONS 2.1 Plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm. 2.2 Permutation and substitution. 2.3 One key for symmetric
More informationChapter 2 : Perfectly-Secret Encryption
COMP547 Claude Crépeau INTRODUCTION TO MODERN CRYPTOGRAPHY _ Second Edition _ Jonathan Katz Yehuda Lindell Chapter 2 : Perfectly-Secret Encryption 1 2.1 Definitions and Basic Properties We refer to probability
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationSTATISTICAL TOOLS USED IN CRYPTOGRAPHIC EVALUATION
Bulletin of the Transilvania University of Braşov Vol 4(53) No. 2-2011 Series III: Mathematics, Informatics, Physics, 129-140 STATISTICAL TOOLS USED IN CRYPTOGRAPHIC EVALUATION Adela GEORGESCU 1 Ruxandra
More informationDTTF/NB479: Dszquphsbqiz Day 26
DTTF/NB479: Dszquphsbqiz Day 26 Announceents:. HW6 due now 2. HW7 posted 3. Will pick pres dates Friday Questions? This week: Discrete Logs, Diffie-Hellan, ElGaal Hash Functions, SHA, Birthday attacks
More informationlecture 36: Linear Multistep Mehods: Zero Stability
95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,
More informationAN ENHANCED CRYPTOGRAPHIC SUBSTITUTION METHOD FOR INFORMATION SECURITY
! """#$# AN ENHANCED CRYPTOGRAPHIC SUBSTITUTION METHOD FOR INFORMATION SECURITY *Kallam Ravindra Babu 1, Dr. S. Udaya Kumar 2, Dr. A. Vinaya Babu 3 and Dr. M. Thirupathi Reddy 4 1 Research Scholar (JNTUH),
More informationMulticollision Attacks on Some Generalized Sequential Hash Functions
Multicollision Attacks on Soe Generalized Sequential Hash Functions M. Nandi David R. Cheriton School of Coputer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada 2nandi@uwaterloo.ca D.
More informationPublic Key Cryptography
Public Key Cryptography Spotlight on Science J. Robert Buchanan Department of Mathematics 2011 What is Cryptography? cryptography: study of methods for sending messages in a form that only be understood
More informationIntroduction to Discrete Optimization
Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and
More informationAn Introduction to Cryptography
An Introduction to Cryptography Spotlight on Science J. Robert Buchanan Department of Mathematics Spring 2008 What is Cryptography? cryptography: study of methods for sending messages in a form that only
More informationReal scripts backgrounder 3 - Polyalphabetic encipherment - XOR as a cipher - RSA algorithm. David Morgan
Real scripts backgrounder 3 - Polyalphabetic encipherment - XOR as a cipher - RSA algorithm David Morgan XOR as a cipher Bit element encipherment elements are 0 and 1 use modulo-2 arithmetic Example: 1
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More information