IT
Name
Institution
IT
The one-time pad is basically a method of encryption that is hard to decrypt, but needs the utilization of a one-time pre-shared key of a similar size as the sent message. In this method, a pairing is made between a plain text and a secret key (also known as an OTP). Then, every character or bit of the plaintext is coded by joining it with the matching character or bit from the pad utilizing modular addition. If the key is really random, at least of a similar length as the plaintext, never recycled partly or in whole, and kept entirely secret, then the resulting ciphertext will not be possible to break or decrypt (Louridas, 2017). There is proof that any cipher that has the property of ideal secrecy must utilize keys with effectively similar stipulations as OTP keys. An example of a device that utilizes an OTP is a hardware token.
A mantrap refers to an access control system that comprises of a tiny space and 2 doors that interlock. One set of the doors must close prior to the other one opening so that a person is ‘trapped’ briefly in the entrance prior to the clearing of the 2nd door (Pathan, 2014). In a mantrap that is manual, a guard locks and unlocks every door in series. In an automatic mantrap, there is the need for identification for every door.
The difference between “fail-safe” and “fail-secure” configurations is that whereas fail-safe locks become unlocked when power goes out or is removed (that is, power is applied to lock the door), fail-secure locks are locked when power is removed (that is, power is used to open the door).
References
Louridas, P. (2017). Real-world algorithms: A beginner’s guide. MIT Press.
Pathan, A. K. (2014). The state of the art in intrusion prevention and detection. CRC Press.
