Grila SI 3
Cryptography Knowledge Quiz
Test your knowledge of cryptography and algorithms with this engaging quiz! Dive into questions about hashing fun
This quiz is perfect for:
- Cryptography enthusiasts
- Students of computer science
- Anyone interested in security practices
Fie 6 inputuri diferite pentru functia MDS (128 bit),daca pentru primele 5 din acestea, outputul avut ultimul octet 0XFF care este probabilitatea ca si al saselea sa aiba octetul 0XFF la sfarsit:
La ce se refera metoda OAEP:
Un padding pt AES
Un padding pt Diffie-Hellman
Un cod de criptare bloc
CORECT (padding pt RSA)
Daca o functie hash are output pe 32 de biti, ne asteptam la o coliziune arbitrara cu probabilitate de 1/2 dupa aproximativ cate intrari:
Ce gasim la iesire daca L =0x FF si R = 0xEE sunt intrari intr-o runda Feistel cu functia de runda f = identitate:
{"name":"Grila SI 3", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge of cryptography and algorithms with this engaging quiz! Dive into questions about hashing functions, encryption methods, and more.This quiz is perfect for:Cryptography enthusiastsStudents of computer scienceAnyone interested in security practices","img":"https:/images/course8.png"}