Answered You can buy a ready-made answer or pick a professional tutor to order an original one.
Problem 1.(10 marks) Modular Arithmetic is the basis of many cryptosystems. Integer ring Zm also used modular arithmetic. Answer the given questions for Z13 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12
Problem 1.(10 marks) Modular Arithmetic is the basis of many cryptosystems. Integer ring Zm also used modular arithmetic. Answer the given questions for Z13 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}.
a (1 marks) Calculate value of x when x=17 mode 13.b (1 marks) Calculate value of x when x=15 × 17 mode 13.
c (1 marks) Calculate value of x when x=72 mode 13.d (2 marks) Calculate value of x when 7x=8 mode 13. 1
e (2 marks) How many elements is in Z13 that has Greatest Common Divisor (GCD) 1 with 13? f (3 marks) Calculate inverse of 7 in Z13 and calculate s and t so that GCD(13, 5) = 13s + 7t.
Problem 2.(10 marks) Old cipher can be a good illustration of basic cryptography. This question regarding the Substitution, Shift and Affine cipher.
a (2 marks) Decrypt the given message encrypted by the Substation cipher and calculate key K. Fubswrjudskb fdq eh d fkdoohqjlqj vxemhfw wr ohduqc exw lw fdq dovr eh yhub
lqwhuhvwlqj dqg uhzduglqje
b (4 marks) Perform an attack against the given ciphertext using letter frequency count. Recover
the plaintext for the given ciphertext.
Aol Jhlzhy Jpwoly aljoupxbl pz vul vm aol lhysplza huk zptwslza tlaovkz vm lu- jyfwapvu aljoupxbl. Pa’z zptwsf h afwl vm zbizapabapvu jpwoly, p.l., lhjo slaaly vm h npclu alea pz ylwshjlk if h slaaly dpao h mpelk ubtily vm wvzpapvuz kvdu aol hswohila.
c (4 marks) Encrypt the plaintexts found in question 1 and 2 by Affine chipher using given keys: (a) K =[3,13] for question 1.
(b) K =[7,13] for question 2.
Problem 3.(10 marks) Random number generation is a process often called random number gener- ator (RNG) by which a sequence of numbers is generated which cannot be reasonably predicted better than by random chance. Answer following questions regarding random number.
a (3 marks) What are the main properties of true random number. Give few examples about the sources of true random number.
1This problem is called discrete logarithm and a hard problem
1
b (3 marks) Pseudo random generator needs a true random number as seed to generate pseudo random number. What are the limitations of pseudo random number.
c (4 marks) Write a short note on a generator of cryptographic secure pseudo random number.
Problem 4.(10 marks) A block cipher is a method of encrypting data in blocks to produce ciphertext using a cryptographic key and algorithm. DES, Triple DES and AES are three well known and widely acceptable block cipher algorithms. Answer the following questions regarding all three block ciphers:
a (3 marks) DES structure is based on Feistel network. Draw the structure of Feistel network. b (2 marks) What are the main limitation of DES algorithm.
c (2 marks) How triple DES solve the limitations of DES algorithm. d (3 marks) What are the main components of AES algorithm.
Problem 5.(10 marks) A Mode of Operation describes how to repeatedly apply a cipher’s single- block operation to securely transform amounts of data larger than a block. Two well known mode of operation are ECB and CBC mode.
a (2 marks) What are the main limitations of ECB mode operation. b (2 marks) What are the two main ideas of CBC mode operation?
c (2 marks) Draw a block diagram of CBC model operation.d (4 marks) Write a short note on (i) Quantum computer, and (ii) Post-quantum cryptography.
Bonus Question.(10 marks) In cryptography, we used different terminologies and they have their meaning. Write a short not for the given terms in your own words (not more than five sentences)
a (1 marks) Brute-force Attackb (1 marks) Unconditional Security
c (1 marks) Unpredictabilityd (1 marks) Confusion Operation
e (1 marks) Diffusion Operation f (1 marks) Integer Ring
g (1 marks) Prime Fieldh (1 marks) S-Box Operation
i (1 marks) Block Cipherj (1 marks) Modes of Operation
- @
- 92 orders completed
- ANSWER
-
Tutor has posted answer for $10.00. See answer's preview
******* ** ********* ***** of x when **** **** *** * 17 mod ******* 17 ** ******* **** ** ** can ******** *** modulus **** **** ** ** find *** ********** ***** within the ***** ***** * ** * *** = 4b Calculate ***** of * **** **** ** ** **** *** * *** ** 17) *** ******* calculate *** product:15 × ** * ******* ***** *** ****** *********** = 255 *** **** find *** remainder **** dividing *** ** * ** can ******** ********* ** ****** * ** ** ** * ********** * = ** ********* ***** of * **** ***** **** *** * *** *** ******* ********* *** ********** * ****** ***** *** ****** *********** * ** *** 13To find *** ********* **** ******** 49 by 13 ** *** ******** multiples ** ***** * * ** ** = *********** x * *** Calculate ***** ** * when 7x=8 **** **** * * *** **** ***** *** * ** **** ** **** *** modular ******* ** * ** *** *** ******* ******* of a ****** * ** *** number * **** that ** ≡ 1 (mod **** **** **** *** ******* inverse of 7 ** Z13 is * **** means **** * × * ≡ * (mod ************** **** ***** ** the equation 7x *** * **** 13) by the ******* inverse ** * we ****** ** 2)x ≡ * ** * (mod ******** * ** 2 ≡ * **** 13) ** have:x ≡ ** **** ***** find *** ********** ***** ** 16 ****** *** ******** *** ********* = ** * *** * ********** x * ** *** **** elements *** in Z13 **** have ******** Common ******* ***** 1 with ****** elements ** Z13 **** **** * GCD of * **** 13 *** ***** **** are relatively ***** ** 13 These *** *** ******* **** do not ***** *** ****** ******* **** ** other **** 1In *** the ******* ********** prime to ** are: 1 * 3 4 * * * 8 * ** 11 and ** ***** are ** **** elementsf Calculate ******* of * ** *** *** ********* * *** * ** **** GCD(13 5) * *** * 7tWe already found *** ******* ******* ** * in *** ** question d *** modular inverse ** * ** *** ** *** **** * *** * **** **** ****** ** = *** * ** we can *** *** ******** ********* algorithmThe ******** ********* algorithm ** a ****** *** finding *** greatest ****** ******* ** two ******** *** ********** it ** * ****** *********** ** ***** **************** *** extended ********* algorithm ** 13 *** 5 we get:GCD(13 5) = * = ** ** * * 5 ** ************* * * * *** * * ********* ** ********** *** ************ ********* *********** ************* *** eh * *********** vxemhfw ** ****** *** ** fdq **** ** yhub *********** *** ************* ********* *** letter frequencies and ******** ** *** ****** *** key *** *** ************ ***************** ************************************* ***************************** **** ********* ***** ************** ******** ************* can be a *********** ******* ** learn *** ** can also ** **** interesting *** *********** Frequency Analysis ********* *********** **** Jhlzhy ****** aljoupxbl ** *** ** *** lhysplza *** ******** ******* ** *** ******** ********* ****** ****** h **** ** ************ ****** ** **** ****** ** h ***** **** ** ******** ** * ****** **** * ***** ****** ** ********* kvdu aol hswohila"Using ****** ********* ******** we *** ******** *** **** ****** ******* ** the ********** *** match them to *** most ****** letters ** ******************* *** * the pz * ** ** = ** huk * andBy ************ these ******* *** ********* *** context ** *** ******** *** ****** message:Plaintext: **** ****** ****** ********* ** *** ** *** ******** and most widely ***** ********** ********** **** * **** of ************ cipher ** **** ****** ** * message ** ******** ** * ****** **** ***** ****** ** ********* **** *** alphabet"c ********** **** ****** ******* Encrypting "Cryptography *** ** a challenging ******* ** learn *** ** *** **** ** very *********** and ********** with * = ** 13]Using *** Affine cipher formula: **** = (ax + b) mod ** where * = 3 *** * * 13:Ciphertext: *************** *** ** d ************ ******* wr ohduqc *** ** *** **** ** **** *********** *** uhzduglqjh"2 ********** **** ****** ****** ********* ** *** ** *** simplest *** **** widely ***** ********** techniques **** * **** of ************ cipher ie **** ****** of * message ** replaced by * ****** **** ***** ****** ** ********* **** the alphabet" **** * * ** ******** *** Affine ****** ******** **** * *** * ** *** ** ***** * = * *** b = ************** "Aol ****** Xbpsby ********* py vul vm *** ********* *** zptwslza tlaovkz ** *** jyfwapvu aljoupxbl ****** ****** * afwl vm ************ xbpsby ** ybjo ****** ** * ***** **** ** ******** ** * ****** **** * ***** ****** ** ********* **** *** **************** 3a Properties *** ******* ** **** ****** NumbersProperties ** True ****** ************************ **** ****** numbers are ********** ************* and cannot be ********** ** *** ******** or ********** ***************** ************* True random numbers *** ************* independent meaning **** each number ** generated ******* any *********** ** ******** or subsequent valuesUniform ************* **** random numbers *** ********* *********** ******* that each number *** ** ***** *********** of being **************** ** **** ****** *************** ********** True ****** ******* can ** ******* **** unpredictable ******** ********* **** ** thermal noise *********** ***** radioactive ***** ** quantum *************** ****** ****** *********** *********** ******** ******* *** generate **** random ******* ** ********* and ********* ************* physical phenomenab *********** ** Pseudo ****** ******************** ******* ************* ******* are ********* ** ************* algorithms ***** means **** *** sequence ** numbers ** ultimately predictable if *** initial seed ***** is knownPeriodicity: ************* ****** ********** **** a finite ****** ******* **** the ******** ** ******* will ********** repeat ***************** ** **** ******* The quality ** ************* numbers ** ****** dependent on *** initial **** ***** * **** ** *********** **** *** lead ** a less ****** sequencec Cryptographically ****** ****** Random ****** ********** **************** *** a ******* class ** ************* ****** generators that are ******** ** **** *** ********* ******** ************ ** ************* ************ **** possess ********** ********** **** make **** ******** for use ** ************************** Security: CSPRNGs *** ******** ** ********* ******** ** ******* or **************** *** ******** ** ******* **** with ********* ** the ********* and **** ********* ************** ******** CSPRNGs ******** ******* ******* ******* **** if *** ******* ***** of the ********* is *********** ** does *** ********** *** ******** ** previously generated *********** Period: CSPRNGs **** * **** **** ****** ****** ** *************** ********** ** ******* *** ****** ******** *** ******** *************** *** ********* for ******* ************* ************ including *** ********** encryption *** ************** They ******* * reliable ****** ** ************* and ****** random ******* that are ******* *** *********** *** *************** and ********* of ********* ****************** 4a Feistel Network ************ Feistel ******* ** * ********* ********* ******** **** ** block ******* including *** It involves ******** the plaintext block **** *** ****** *** *********** ******** * ***** ******** to *** **** ***** ****** *** ****** with *** other **** *** process is repeated *** ******** ****** with *** ****** ******** positions each ****** *********** ** DES AlgorithmKey ***** DES **** * 56-bit key ***** is ********** too ***** *** modern ******** ********* This ***** ** ********** ** *********** attacks especially **** advancements in ********* powerVulnerability ** ************** *** *** **** ********* ** ******* ************* ********** such ** ************ ************* *** linear cryptanalysis ***** **** ******* weaknesses ** *** designPerformance Limitations: DES ** relatively slow compared to ***** ***** ciphers making ** less ********* for ********** encryption applicationsc *** ****** *** Solves *** Limitations ** *** AlgorithmTriple DES ****** ********* *** *** **** ********** ** *** ** ******** *** ***** ***** with ***** ********* keys effectively ********** the *** ****** to 168 **** This ************* ********* *** ******** against *********** ******* ***** **** ** **** ****** than *** ** ** ***** slower than ***** algorithms *** *** **** ********** ** *** *** **** applicationsd **** Components of *** ************ ** Advanced ********** ******** ** * ****** **** ***** cipher that offers ******** ******** *** better *********** compared ** *** *** **** *** **** ********** include:Substitution-Permutation ******* ****** *** uses ** *** ********* ***** **** blocks *** subjected to * series of ************ *** *********** operations ** ******* ********* *** ************ ********* *** ******* a *** schedule ********* ** ****** ***** **** **** *** ******* encryption *** ***** ***** **** *** **** ** each round ** the ********** *************** ******* *** ******** multiple rounds of encryption typically 10 12 ** ** ****** ********* on *** key **** Each ***** ******** substitution *********** *** XOR operationsProblem ** *********** ** *** Mode **************** ******** *** **** ******** **** ***** independently ***** *** ****** ******** ** *** ********* ** identical blocks ***** **** ***** ** ********** to statistical ******** attacksLack ** ********** *** **** **** *** ********* ******* ****** ****** ** errors ** ************* ** one block ** *** ****** ********** ****** **** makes ** *********** ** **** ************ attacksb *** **** Ideas of *** **** OperationChaining: CBC **** ****** **** ******* encryption to *** ******** ******* ciphertext introducing dependency ******* ****** This ***** ** **** patterns *** propagate ******* ********** *** ********************* ****** ***** *** **** **** ** ** ** randomize *** ********** ** *** first block ********** identical ********* ****** from ********* identical ********** blocksc ***** ******* ** *** **** ******************* P1 ** P3 *********** ** C2 C3 **** *************** ******* *************** * *** ** *** ***** * *** ** *** ***** = *** ** *** **************** = *** C1) *** **** = *** C2) *** **** * D(K *** ⊕ *** ***** ******** Quantum ********* ******* ******** is * ************* ********* ******** **** harnesses the ********** of ******* ********* to ******* ************ Unlike classical computers ***** ***** *********** as **** (0 or 1) ******* ********* *** ******* bits ** qubits which *** ***** in a ************* ** **** and * ************** **** ******* ******* computers ** ******* ******* calculations exponentially ****** than ********* computers(ii) Post-Quantum ************************ ************ ***** is a field ** ************ **** **** ** develop ********** *** protocols ********* ** ******* ** ******* computers As quantum ********* mature **** **** * ****** ** ******* ********** ************ ******* **** ** *** *** ******** ***** ************ (ECC) which rely ** *** ********** of ********* ***** numbers ** ******* discrete ********* ******** *** ********** *** ******** ** withstand ***** quantum attacks ensuring ****** ************* **** in the ******** ** ******** ******* ************** ********* *********** ******* *********** ****** ** * *************** ****** ** ******** * ************* ****** ** systematically ****** ***** ******** key or password ***** *** ******* one ** ****** ************* ********************* security **** ***** ** ********************* ******** is a *********** ******* in ************ ***** the ******** ** ** encryption ****** ** not based ** *********** ***** *** ************* ********* ** an ********* ******************************** ** * property of ************* ********** **** ensures *** output ** *** algorithm cannot ** predicted with * **** degree ** ******** **** with ********* ** *** ********* *** some of *** ******* ********* ********** ********* ********* is * cryptographic ********* that **** ** make the ************ between the ********* *** ciphertext as complex *** ********** ** ******** making ** ********* *** ** ******** ** ****** *** plaintext **** the *********** ********* OperationA ********* ********* ** a cryptographic ********* **** ******* *** influence ** each plaintext bit **** multiple ********** bits ******** **** ***** ******* ** the ********* ****** in *********** ******* in *** *********** ******* ****** ******* **** ** * ************ ********* ********** ** * set ** integers *** *** ********** ******** *** ************** that ******* ******* *********** ***** FieldA ***** ***** **** known as * ****** ***** ** * finite ***** with * ***** ****** of elements It ** * *********** ********* **** ** various cryptographic *********** ***** *********** ***** operation ** * ********** ************ ********* **** ** ***** ciphers ** ******* ***** ****** with output values according ** * predefined ****** ****** ***** ******* ***** ****** ** a ********* ********** ********* **** ******** **** ** ********** ****** typically ***** a *********** ** ************ *********** *** *** operationsj Modes ** ************** ** ********* *** methods *** ***** a block ****** ** encrypt **** ****** **** the ***** **** ********* ********** ******** ******** such as **** ********* *** ***** ***********
