2 views

Uploaded by Marcos Valle

Semana 2 do curso

- q5sol
- Chapter 3 Review Questions
- The MEANS Radio Procedures.pdf
- 564_XuYufei_Assignment3
- L01
- antenna.pdf
- Lora Alliance Security
- Flexible Histories Hiding in Encoded Imaginings
- Modes of Operation
- Data Security and Encryption
- Manuscript 2
- Lecture 2
- Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage
- symetric java
- sensors-18-01306-v2.pdf
- A Review on Key-Aggregate Cryptosystem for Climbable Knowledge Sharing in Cloud Storage
- Maths
- d
- Chuck Missler Cosmic Codes Notes 01
- Encrypting a Linux Partition Using LUKS

You are on page 1of 11

pass.

Review the material and try again! You have 3

attempts every 8 hours.

1 of 11 17/11/2016 15:58

Week 2 - Problem Set | Coursera https://www.coursera.org/learn/crypto/exam/N...

1/1

points

1.

Consider the following ve events:

1/10 6 ).

likely?

2, 3, 4, 1, 5

Correct

The probability of event (1) is 1/2^128.

about 1/2^{139}. Therefore, event (5) is the least likely.

about 1/2^{119.5} which is more likely than event (1).

(4).

2, 3, 1, 4, 5

3, 2, 5, 4, 1

2, 3, 4, 5, 1

2 of 11 17/11/2016 15:58

Week 2 - Problem Set | Coursera https://www.coursera.org/learn/crypto/exam/N...

1/1

points

2.

Suppose that using commodity hardware it is possible to

build a computer

for about $200 that can brute force about 1 billion AES keys

per second.

for a single

buy these

How long would

key with

maintenance.

(10 9) years

Correct

The answer is about 540 billion years.

2*10^19

3 of 11 17/11/2016 15:58

Week 2 - Problem Set | Coursera https://www.coursera.org/learn/crypto/exam/N...

0/1

points

3.

(i.e. a PRF where the key space, input space, and output

one correct answer):

((1 , 2 ), ) = (1 , )

(2 , ) (here

denotes concatenation)

Correct

for .

(, ) =

Un-selected is correct

(, ) when 0

(, ) =

otherwise

obtain $k$ and then

4 of 11 17/11/2016 15:58

Week 2 - Problem Set | Coursera https://www.coursera.org/learn/crypto/exam/N...

1/1

points

4.

Recall that the Luby-Racko theorem discussed in The Data

Encryption Standard lecture states that applying a three

round Feistel network to a secure PRF gives a secure block

cipher. Let's see what goes wrong if we only use a two

round Feistel.

left 32 bits.

a random key, while the other three are the output of a

outputs are encoded as 16 hex characters.

Can you say which is the output of the PRP? Note that since

5 of 11 17/11/2016 15:58

Week 2 - Problem Set | Coursera https://www.coursera.org/learn/crypto/exam/N...

0/1

points

5.

Nonce-based CBC. Recall that in Lecture 4.4 we said that if

one wants to use CBC encryption with a non-random

unique nonce then the nonce must rst be encrypted with

an independent PRP key and the result then used as the

CBC IV.

Let's see what goes wrong if one encrypts the nonce with

the same PRP key as the key used for CBC encryption.

We show that the resulting system is not nonce-based CPA

secure.

Next, the attacker asks for the encryption of the one block

6 of 11 17/11/2016 15:58

Week 2 - Problem Set | Coursera https://www.coursera.org/learn/crypto/exam/N...

1/1

points

6.

transmits

transmission.

correctly.

plaintext blocks

will be corrupted?

/2

1 + /2

Correct

Take a look at the CBC decryption circuit. Each

ciphertext

the next.

7 of 11 17/11/2016 15:58

Week 2 - Problem Set | Coursera https://www.coursera.org/learn/crypto/exam/N...

1/1

points

7.

and

error,

transmission.

correctly.

plaintext blocks

will be corrupted?

/2

Correct

Take a look at the counter mode decryption circuit.

Each

block.

8 of 11 17/11/2016 15:58

Week 2 - Problem Set | Coursera https://www.coursera.org/learn/crypto/exam/N...

1/1

points

8.

Recall that encryption systems do not fully hide the length

of

hasbeen used to eavesdrop on encrypted HTTPS trac to a

number of

and

healthcare sites.

that the

random IV. The

following

principle

machine.'

Correct

The length of the string is 107 bytes, which after

padding becomes 112 bytes,

assuming its truth, is

design ciphers that

9 of 11 17/11/2016 15:58

Week 2 - Problem Set | Coursera https://www.coursera.org/learn/crypto/exam/N...

1/1

points

9.

: 5 dened as follows:

= [0]

for i=1 to 4 do

(, ) :=

if([ 1] == 1) = []

output

That is, the key is = ([0], [1], [2], [3], [4]) in 5 and

(, 1110) = 0110 .

able to predict the function at a new point, this PRF is

insecure.

10 of 11 17/11/2016 15:58

Week 2 - Problem Set | Coursera https://www.coursera.org/learn/crypto/exam/N...

1111

Correct Response

11 of 11 17/11/2016 15:58

- q5solUploaded byNickHenry
- Chapter 3 Review QuestionsUploaded byJason Reed
- The MEANS Radio Procedures.pdfUploaded byDe Awe
- 564_XuYufei_Assignment3Uploaded byjohndelosa
- L01Uploaded bymostafaa1
- antenna.pdfUploaded bysita annapurna
- Lora Alliance SecurityUploaded bySyed Muhammad Danish
- Flexible Histories Hiding in Encoded ImaginingsUploaded byIRJET Journal
- Modes of OperationUploaded byNivi Senthil
- Data Security and EncryptionUploaded byWaseem Khan
- Manuscript 2Uploaded byAbhilasha Jaiswal
- Lecture 2Uploaded byd3toxed
- Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud StorageUploaded byNarendra Babu
- symetric javaUploaded byRonak Agrawal
- sensors-18-01306-v2.pdfUploaded byRam Bhagat Soni
- A Review on Key-Aggregate Cryptosystem for Climbable Knowledge Sharing in Cloud StorageUploaded byATS
- MathsUploaded byVictor Muchoki
- dUploaded byNitesh Agarwal
- Chuck Missler Cosmic Codes Notes 01Uploaded byVeronica Andreassen
- Encrypting a Linux Partition Using LUKSUploaded byrajesh_shukla8220
- Log Analysis of Cyber Security Training ExercisesUploaded byim
- Homework1 AnswerUploaded byAnkit Chudrahi
- A Comprehensive Review on Advance Mechanism For Secure Image Data TransmissionUploaded byIRJET Journal
- CryptUploaded byPisarenco Grigore
- 03.2 Application ControlUploaded byMCI
- Hacktivist attacksUploaded byali3800
- 73241837 Secrecy Paper 1Uploaded byWeramac
- 00601632Uploaded byvandersonpc
- VRC4Uploaded byDiego Rosales

- O Longo Dia Das Bruxas #01 de #08 [HQOnline.com.Br]Uploaded byVerônica Alcântara
- Operating Systems ConceptsUploaded bydrcsu
- UsuariosUploaded byMarcos Valle
- O CORVO MachadoAssisUploaded byGeraldo Barbosa Neto
- be50-16Uploaded byMarcos Valle
- be50-16Uploaded byMarcos Valle
- lab7Uploaded byMarcos Valle
- Die_Nachbarn.pdfUploaded byIulia Paun
- Cel Lima Costa - o Setor Cibernético No Exército BrasileiroUploaded byMarcos Valle
- apostila Estacio GestaoUploaded byMarcos Valle
- VLab Demo - Using ASM for Web Vulnerabilities - V12.0.0.01Uploaded byMarcos Valle
- easyctf_writeupsUploaded bySaishDabholkar
- Exp_regUploaded byMarcos Valle
- tireoideUploaded byMarcos Valle
- tireoideUploaded byMarcos Valle
- PERFORMANCE EVALUATIONS OF CISCO ASA AND LINUX IPTABLES FIREWALL SOLUTIONSUploaded byMarcos Valle
- D3simulados_1simuladaoIME_db2d1bc7f17a3a44b4f1cb9075f6899cUploaded byGuilherme Rocha
- mileumanoitescontosselecionadosUploaded byAmanda Santos
- mileumanoitescontosselecionadosUploaded byAmanda Santos
- D3Simulados - Resolucao - Teste Piloto (16!05!2013)Uploaded byMarcos Valle
- 2008 Anpad, Gabarito, Setembro, DocUploaded byMarcos Valle
- 04 - SlidesUploaded byMarcos Valle
- joomscandbUploaded byMarcos Valle
- Lista de Exercicio VF 2014_1_reduzidoUploaded byMarcos Valle
- Pladis IMEUploaded byMarcos Valle
- Exemplo Plano SessãoUploaded byMarcos Valle
- Niemann - Performance Evaluation of NetfilterUploaded byMarcos Valle
- RMO-12-PAPER-1Uploaded byNilesh Gupta
- Lab1 Crypto EncryptionUploaded byMarcos Valle

- 12_more_things_about_oracle_12c.pptxUploaded byAshok Sodha
- OrionFailoverEngineQuickStartGuideUploaded bytredd2
- D3 Tips and Tricks LatestUploaded bySagi Santosh Raju
- OPC Factory ServerUploaded bygeorgel1605
- Introduction to Lenovo EMC and StorCenterUploaded by20mateo13
- EEKOL_2010NOV18_INTD_AN_02Uploaded bydonghyun
- Encrypted Network File SystemUploaded byrobinthomas176693
- SelectionUploaded bysebas9516
- ch5-radiosityUploaded byLeonardo Bouchan
- Angular Auth GuardUploaded byसूरज मद्धेशिया
- hts-logUploaded byteknis komp
- CS302 - Object Oriented ProgrammingUploaded byPercival A Fernandez
- IBM System x3650 M4.pdfUploaded bycatgani
- Windows 2008 ServerUploaded byMohan Lingappa
- Wrestling the Snake - Performance Tuning 101Uploaded byWes Morgan
- 3.2 Final Report TemplateUploaded byAimanNamia
- Introduction to ProModelUploaded byVoni Meistherson
- Teradata SQL Performance Tuning TipsUploaded byYuvaraj Manohar
- Class 12Uploaded byDarya Memon
- Introduction to Form PersonalizationUploaded bySaurabh Sonkusare
- Chapter 1 Data RepresentationUploaded bySamira Yasser
- 5Uploaded byAnonlim
- ComSys - Final LectureUploaded byChechan Amba
- HINA Manolo Dulva-WebUploaded byLina Lalouta Saadi
- Topological Sorting - GeeksforGeeksUploaded byRidho Pratama
- GAT Computer ScienceUploaded bysaeedturk
- MAPREDUCE BIG DATAUploaded byLeslie
- Revit DOs and DONTsUploaded byMoiz Tinwala
- 51146021822db89f1afc667503d26987[1]Uploaded byaydeee12
- fm-tutUploaded byprathi_M