Criptografie si securitate

Number: 000-000
Passing Score: 500
Time Limit: 45 min
File Version: 1.0
Exam A

QUESTION 1

A.

B.

C.

D.

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 2

A. MAZI
B. MAXI
C. LAZH
D. LAZI

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 3

A. CASA
B. CASE
C. SACA
D. CASE

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 4

A. VXBQ
B. WXBQ
C. VXCR
D. VXBP

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 5

A. ZARE
B. AZUR
C. ZARI
D. RAZA

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 6

A.

B.

C.

D.

Answer: D
Section: (none)

Explanation/Reference:

QUESTION 7

A. EYUG
B. EEUY
C. YUGE
D. UEYG

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 8
Considerati alfabetul latin din care eliminati litera de frecventa redusa Q. Folosind sistemul de codificare Polybios, codificati textul clar STIRPIRE. Alegeti varianta
corecta din cele de mai jos.

A. DDDEBDDBDABDDBAE
B. DCDDBDDBDABDDBAE
C. DCDEBDDBDABDDBAE
D. DCDDBDDBDABDDDAE

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 9
Considerati alfabetul latin din care eliminati litera de frecventa redusa W. Folosind sistemul de codificare Polybios, decodificati textul criptat
AEECACCBAACCAADCAE. Alegeti varianta corecta din cele de mai jos.

A. EXCLUDERE
B. EXCLAMARE
C. EXCHANGE
D. INCLUDERE

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 10
Considerati alfabetul latin din care eliminati litera de frecventa redusa Q. Folosind sistemul de codificare Polybios, decodificati textul criptat
AEECACCBAACCAADCAE. Alegeti varianta corecta din cele de mai jos.

A. EXCLUDERE
B. EXCLAMARE
C. INCLUDERE
D. EXCLAMASE

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 11
Considerati alfabetul latin din care eliminati litera de frecventa redusa W. Folosind sistemul de codificare Polybios, codificati textul clar UNIVERSITATE. Alegeti
varianta corecta din cele de mai jos.

A. EACDBDEBAEDCDDBDDEAADEAD
B. EACDBDEBAEDCDDBDDEAADEAE
C. AECDBDEBAEDCDDBDDEAADEAE
D. AECDBDEBAEDCDDBDDEAADEAD

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 12
Considerati alfabetul latin din care eliminati litera de frecventa redusa W. Folosind sistemul de codificare Polybios, decodificati textul criptat
AEECACCBAACCAADCAE. Alegeti varianta corecta din cele de mai jos.

A. EXCLAMARE
B. EXCLAMATE
C. EXCLAMARI
D. EXCLUDERE

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 13

A. AHFUT
B. BNFZT
C. BNFUT
D. ANFVT

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 14

A. YFOZG
B. WDMXE
C. XENYF
D. VCLWD

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 15

A. DJNST
B. BHLQR
C. CIMRS
D. EKOTU

Answer: A
Section: (none)

Explanation/Reference:
A
QUESTION 16

A. EZGAW
B. ZEGXW
C. ZEGWX
D. EZGAX

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 17

A. UVLBO
B. UVLBR
C. VULBO
D. VULCO

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 18
Codificati textul clar USCAT folosind sistemul de criptare Vigenere cu cheia secreta LABIL. Solutia este...

A. FSDIF
B. ESDIF
C. FSDIE
D. ESDIE

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 19
Codificati textul clar CRIPTOGRAFIE folosind sistemul de criptare Vigenere cu cheia secreta GRUPA. Solutia este...

A. IIIHTUXRSFOV
B. IICETUXIPFOV
C. IICETUXLPFOV
D. IICHTUXLSFOV

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 20
Codificati textul clar INCAS folosind sistemul de criptare Vigenere cu cheia secreta GARA. Solutia este...

A. UNTAY
B. NMTAY
C. ONTAY
D. ONTAZ

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 21
Codificati textul clar ZIMBRU folosind sistemul de criptare Vigenere cu cheia secreta BILA. Solutia este...

A. ARYBSC
B. AQXCSB
C. AQXBSC
D. AQYBSC

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 22
Codificati textul clar UMBRA folosind sistemul de criptare Vigenere cu cheia secreta CARD. Solutia este...

A. WMSUG
B. WMSUC
C. KMSUC
D. WMSUQ

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 23
Codificati textul clar IMPAR folosind sistemul de criptare Vigenere cu cheia secreta VARF. Solutia este...

A. DMGFM
B. DUGFM
C. DMIAM
D. DMGZM

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 24
Decodificati textul criptat VUJNIC, codificat cu sistemul de criptare Vigenere cu cheia secreta CUI. Solutia este...

A. CABINA
B. TABLOU
C. CANINA
D. TABELA

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 25
Decodificati textul criptat VUJGFI, codificat cu sistemul de criptare Vigenere cu cheia secreta CUI. Solutia este...

A. TABLOU
B. CANINA
C. TABELA
D. CABINA

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 26
Decodificati textul criptat EUJKHI, codificat cu sistemul de criptare Vigenere cu cheia secreta CUI. Solutia este...

A. CABINA
B. CANINA
C. TABELA
D. TABLOU

Answer: A
Section: (none)

Explanation/Reference:
A
QUESTION 27
Decodificati textul criptat EUVKHI, codificat cu sistemul de criptare Vigenere cu cheia secreta CUI. Solutia este...

A. TABELA
B. TABLOU
C. CABINA
D. CANINA

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 28
Folosind sistemul de criptare asincron cu auto-cheie k=7,codificarea textului clar STRIGAT este ....

A. ZSJRXXQ
B. SSJRXQQ
C. SZRJQXQ
D. ZZRJXXQ

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 29
Folosind sistemul de criptare asincron cu auto-cheie k=11,codificarea textului clar GRADINA este ....

A. RIILTGG
B. RIJLTGG
C. RIILSHH
D. RIILSHI

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 30
Folosind sistemul de criptare asincron cu auto-cheie k=7,codificarea textului clar GRADINA este ....

A. LEHHPCD
B. MEHHPCD
C. NEEHPCC
D. OEEHPCC

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 31
Folosind sistemul de criptare asincron cu auto-cheie k=8,codificarea textului clar CORIDA este ....

A. LXRQAA
B. KYPXAA
C. LYRXAA
D. KYPQAA

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 32
Folosind sistemul de criptare asincron cu auto-cheie pentru k = 11, decodificarea textului criptat RIILTGG este ...

A. GRADINI
B. GRANINI
C. GRADINA
D. GRINDINA

Answer: C
Section: (none)
Explanation/Reference:
C

QUESTION 33
Folosind sistemul de criptare asincron cu auto-cheie pentru k = 8, decodificarea textului criptat ZZEEPP este ...

A. RAVENA
B. RAFALA
C. RAFALE
D. RAMURA

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 34
Folosind sistemul de criptare asincron cu auto-cheie pentru k = 9, decodificarea textului criptat AAVZMM este ...

A. RAVENA
B. RAMURA
C. RAFALE
D. RAFALA

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 35
Folosind sistemul de criptare asincron cu auto-cheie pentru k = 10, decodificarea textului criptat BBNHYY este ...

A. RAFALA
B. RAVENA
C. RAFALE
D. RAMURA

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 36
Folosind sistemul de criptare asincron cu auto-cheie pentru k = 11, decodificarea textului criptat CCHHSW este ...

A. RAFALE
B. RAMURA
C. RAVENA
D. RAFALA

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 37
Folosind sistemul aditiv fluid binar de criptare sa se codifice x=101011, avand cheia k=1010

A. 101010
B. 101011
C. 000001
D. 100000

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 38
Se da secventa binara de text clar 110100.Codificati aceasta secventa folosind cheia fluida 1011, folosind un sistem aditiv fluid binar de criptare.

A. 001010
B. 011010
C. 010010
D. 010110

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 39
Folosind un sistem aditiv fluid binar de criptare se cere criptarea secvenţei de text clar x = 101101, cunoscând cheia fluidă z = 1101.

A. 101101
B. 101010
C. 010010
D. 011010

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 40

A. 1001110110001111
B. 0011011110001111
C. 1100111010001111
D. 0011101100101111

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 41

A. 1011100001000110
B. 1011010001001010
C. 0111001010000101
D. 0110100110001010

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 42

A. 0111000110000110
B. 0110101010000110
C. 1011000110001001
D. 0111000010000110

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 43

A. 1100011010000010
B. 1100011010000011
C. 1010011001000011
D. 1100101010000011
Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 44

A. 1111010110100111
B. 1111010111000111
C. 1111101001011011
D. 1111011010010111

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 45

A. MODELARE
B. SOFTWARE
C. ALGORITM
D. GESTIUNE

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 46

A. MODELARE
B. SOFTWARE
C. ALGORITM
D. GESTIUNE

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 47

A. MODELARE
B. SOFTWARE
C. ALGORITM
D. GESTIUNE

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 48

A. MODELARE
B. SOFTWARE
C. ALGORITM
D. GESTIUNE

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 49

A. 0010011001001101
B. 1110101100010000
C. 1110110011010001
D. 0010010001101100

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 50

A. 0010010001101100
B. 1110110011010001
C. 0010011001001101
D. 1110101100010000

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 51

A. 0010011001001101
B. 1110110011010001
C. 1110101100010000
D. 0010010001101100

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 52

A. 1101000110010011
B. 1000111111001111
C. 0100001100001001
D. 1000100010100110

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 53
A. 0100001100001001
B. 1000111111001111
C. 1000100010100110
D. 1101000110010011

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 54

A. 1101000110010011
B. 1000100010100110
C. 1000111111001111
D. 0100001100001001

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 55

A. 1110011100100111
B. 1111000000111100
C. 1110100011011011
D. 1110011111010111

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 56

A. 1110011100100111
B. 1111000000111100
C. 1110100011011011
D. 1110011111010111

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 57

A. 1110011100100111
B. 1111000000111100
C. 1110100011011011
D. 1110011111010111

Answer: C
Section: (none)
Explanation/Reference:
C

QUESTION 58

A. 1110011100100111
B. 1111000000111100
C. 1110100011011011
D. 1110011111010111

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 59

A. 1100110011000011
B. 1001100110010110
C. 1111010111000000
D. 1111110001100000

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 60

A. 1100110011000011
B. 1001100110010110
C. 1111010111000000
D. 1111110001100000

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 61

A. 1100110011000011
B. 1001100110010110
C. 1111010111000000
D. 1111110001100000

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 62

A. 1100110011000011
B. 1001100110010110
C. 1111010111000000
D. 1111110001100000

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 63

A. 0001100011111010
B. 0010000011011010
C. 0010110111001111
D. 1101101001110101

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 64

A. 0001100011111010
B. 0010000011011010
C. 0010110111001111
D. 1101101001110101

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 65

A. 0001100011111010
B. 0010000011011010
C. 0010110111001111
D. 1101101001110101

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 66

A. 0001100011111010
B. 0010000011011010
C. 0010110111001111
D. 1101101001110101

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 67
A. 1001000001101011
B. 0001110101111100
C. 1001000111111010
D. 1010111011000110

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 68

A. 1001000001101011
B. 0001110101111100
C. 1001000111111010
D. 1010111011000110

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 69

A. 1001000001101011
B. 0001110101111100
C. 1001000111111010
D. 1010111011000110

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 70

A. 1001000001101011
B. 0001110101111100
C. 1001000111111010
D. 1010111011000110

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 71
Sistemul de criptare El-Gamal se bazeaza pe...

A. dificultatea calculului logaritmului discret intr-un corp finit

B. dificultatea descompunerii in factori primi a numerelor mari (de sute de cifre)
C. teoria algebrica a codurilor
D. problema {0, 1} a rucsacului

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 72
Sistemul de criptare Merkle-Hellman se bazeaza pe...
A. dificultatea calculului logaritmului discret intr-un corp finit
B. dificultatea descompunerii in factori primi a numerelor mari (de sute de cifre)
C. teoria algebrica a codurilor
D. problema {0, 1} a rucsacului

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 73
Sistemul de criptare RSA se bazeaza pe...

A. dificultatea calculului logaritmului discret intr-un corp finit

B. dificultatea descompunerii in factori primi a numerelor mari (de sute de cifre)
C. teoria algebrica a codurilor
D. problema {0, 1} a rucsacului

Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 74
Sistemul de criptare McEliece se bazeaza pe...

A. dificultatea calculului logaritmului discret intr-un corp finit

B. dificultatea descompunerii in factori primi a numerelor mari (de sute de cifre)
C. teoria algebrica a codurilor
D. problema {0, 1} a rucsacului

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 75
Pentru codificarea unui text clar se foloseste un sistem de criptare cu cheie publica.
Daca criptanalistul dispune de un text criptat y, atunci acesta poate cauta un text clar x astfel incat
Ce modalitate de aparare considerati a fi posibila in acest caz ?

A. gradul de complexitate al sistemului

B. gradul de complexitate al textului criptat y
C. gradul de complexitate al textului clar x
D. asigurarea accesului la informatie doar partilor autorizate

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 76
Fie cifrul RSA construit cu numerele prime p, q si fie n = pq. Daca n = pq, e este exponentul de criptare si d este exponentul de decriptare, iar m € N, 0 ≤ m ≤ n,
atunci

A.
B.
C.
D.

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 77
Fie d exponentul de decriptare al sistemului de criptare RSA construit cu numere prime p = 3, q = 5. Daca exponentul de criptare este e = 7, determinati d.

A. 3
B. 7
C. 5
D. 13
Answer: B
Section: (none)

Explanation/Reference:
B

QUESTION 78
Fie d = 11 exponentul de decriptare al sistemului de criptare RSA construit cu numerele prime p = 7, q = 11. Determinati exponentul de criptare e.

A. 7
B. 3
C. 11
D. 13

Answer: C
Section: (none)

Explanation/Reference:
C

QUESTION 79
Consideram sistemul de criptare RSA construit cu numerele prime p = 3, q = 5.
Daca exponentul de criptare este e = 4 si se doreste codificarea textului clar m = 11, determinati textul criptat c.

A. 1
B. 3
C. 5
D. 7

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 80
Un utilizator al sistemului de criptare RSA are ca cheie publica (n, e) = (35, 5) si cheia secreta d = 5. Daca primeste textul criptat c = 3, atunci textul clar decodificat
de utilizator este...

A. 20
B. 7
C. 19
D. 33

Answer: D
Section: (none)

Explanation/Reference:
D

QUESTION 81
Un utilizator al cifrului RSA are ca cheie publica (n, e) = (35, 5) si ca cheie secreta d = 5. Daca primeste textul cifrat c = 33 atunci textul in clar m corespunzator este
:

A. m=3
B. m = 15
C. m = 13
D. m = 11

Answer: A
Section: (none)

Explanation/Reference:
A

QUESTION 82
Fie d exponentul de decriptare al cifrului RSA construit cu numerele prime p = 3 si q = 5. Daca exponentul de criptare este e = 7, atunci

A. d=5
B. d=7
C. d = 11
D. d=3

Answer: B
Section: (none)

Explanation/Reference:
B