- Arts & Culture 6231
- Business & Economics 674
- Computers 316
- Dictionaries & Encyclopedias 74
- Education & Science 76877
- Abstracts 73
- Astrology 4
- Biology 8
- Chemistry 4046
- Coursework 15549
- Culture 8
- Diplomas 316
- Drawings 1595
- Ecology 5
- Economy 76
- English 80
- Ethics, Aesthetics 3
- For Education Students 17573
- Foreign Languages 11
- Geography 3
- Geology 1
- History 88
- Maps & Atlases 5
- Mathematics 12624
- Musical Literature 2
- Pedagogics 19
- Philosophy 22
- Physics 15120
- Political Science 5
- Practical Work 59
- Psychology 63
- Religion 4
- Russian and culture of speech 8
- School Textbooks 7
- Sociology 9
- Summaries, Cribs 87
- Test Answers 160
- Tests 8747
- Textbooks for Colleges and Universities 32
- Theses 7
- To Help Graduate Students 14
- To Help the Entrant 38
- Vetting 385
- Works 13
- Информатика 8
- Engineering 893
- Fiction 706
- House, Family & Entertainment 84
- Law 129
- Website Promotion 68
Mathematical methods of information security Answers Sy
Refunds: 0
Uploaded: 11.03.2021
Content: Ответы к тесту.zip 224,25 kB
Product description
COLLECTION OF ANSWERS - 60 questions. Mathematical methods of information security Answers to Synergy tests. Result Excellent 97/100 points
1. Repetition is ...
2. Substitution is ...
3. One-time encryption is most acceptable for processing ...
4. In an asymmetric RSA cryptosystem ...
5. The message authentication code provides ...
6. When generating a digital signature, it is used ...
7. When simulating active actions of the enemy, he is usually put ...
8. Disposable notepad message integrity check ...
9. The Diffie-Hellman public key distribution system uses ...
10. The Diffie-Hellman protocol is a protocol ...
11. The most important component of the cipher is ...
12. When encrypting according to the GOST 28147-89 encryption standard, the complete dispersion of the input data occurs after ...
13. In a perfect (ideal) cipher, the posterior probabilities of plain texts (calculated after obtaining the cryptogram) ...
14. The enemy´s knowledge of the encryption algorithm ...
15. Formant is a spectrum region, ...
16. Algorithms for the formation and verification of electronic digital signature ...
17. Passive attack carried out by the enemy is associated with ...
18. The measure of the imitation strength of the cipher is the probability of successful ...
19. Perfect security is ensured when with a key ...
20. When verifying a digital signature, it is used ...
21. When considering the practical strength of ciphers, it is assumed that for the cipher in question, there will usually be ...
22. The advantage of asymmetric encryption systems (compared to symmetric systems) is ...
23. Public and private keys in an asymmetric system ...
24. In a simple substitution cipher, each character of the original message corresponds to ...
25. The basis for the formation of symmetric encryption algorithms is the assumption that ...
26. Meaningful plaintext obtained by decrypting a cryptogram generated using a one-time pad ...
27. In stream ciphers at one point in time, the encryption procedure is performed over ...
28. It is not true that an active attack by an adversary involves ...
29. It is not true that in the artificial formation of a speech signal, such a characteristic is used as ...
30. Using a symmetric cryptoalgorithm using different keys for encryption and decryption ...
31. With the increase in channel bandwidth, the possibility of voice identification ...
32. Diffie-Hellman Protocol ...
33. The working characteristic of the cipher is the Average amount of work W (N) required to determine ...
34. It is not true that the advantages of flow systems include ...
35. The number of operations required to determine the used encryption key from the fragment of the encrypted message and the corresponding plain text must be ..
36. In a symmetric encryption system for the independent operation of N subscribers ...
37. The encrypted message must be readable ...
38. The content of the imitation insert should depend ...
39. The enemy, making a substitution or imitation of a message, proceeds from the assumption that ...
40. The reliability of the RSA algorithm is based on ...
41. A renegade is ...
42. The maximum number of rounds of encryption according to the GOST 28147-89 standard is ...
43. It is not true that the disadvantages of asymmetric cryptosystems include ...
44. Practical implementation of the Diffie-Hellman algorithm ...
45. When scrambling a speech signal, change ...
46. An electronic digital signature is ...
47. Information security in the Diffie-Hellman system is based on complexity ...
48. A phoneme is ...
49. The imitation insert is designed to test ...
50. The secret sharing method is used primarily to reduce risks ...
51. In an asymmetric encryption system for the independent operation of N subscribers it is required ...
52. For the initial distribution of keys ...
53.
Additional information
55. The length of the ciphertext must be ...
56. The substitution of an encrypted message involves ...
57. In a symmetric system, the recipient and the sender use to encrypt and decrypt the message ...
58. The average duration of a fricative sound is ...
59. The average duration of an explosive sound is ...
60. The disadvantage of asymmetric encryption systems is ...
Feedback
0Period | |||
1 month | 3 months | 12 months | |
0 | 0 | 0 | |
0 | 0 | 0 |