On formal verification of arithmetic-based cryptographic primitives

Cryptographic primitives are fundamental for information security: they are used as basic components for cryptographic protocols or public-key cryptosystems. In many cases, their security proofs consist in showing that they are reducible to computationally hard problems. Those reductions can be subtle and tedious, and thus not easily checkable. On top of the proof assistant Coq, we had implemented in previous work a toolbox for writing and checking game-based security proofs of cryptographic primitives. In this paper we describe its extension with number-theoretic capabilities so that it is now possible to write and check arithmetic-based cryptographic primitives in our toolbox. We illustrate our work by machine checking the game-based proofs of unpredictability of the pseudo-random bit generator of Blum, Blum and Shub, and semantic security of the public-key cryptographic scheme of Goldwasser and Micali.Comment: 13 page

Simulation of The Application of Intelligence in Vernam Cipher Cryptography (One Time Pad)

Technological advances in the field of computers allow thousands of people and computers around the world to be connected in one virtual world known as cyberspace or the Internet. But these technological advances are always accompanied by the downside of the technology itself. One of them is the vulnerability of data security, giving rise to challenges and demands for the availability of a data security system that is as sophisticated as the advancement of computer technology itself. In this study, an algorithm that can secure data will be used which the authors discuss is the Vernam Cipher Algorithm. Vernam Cipher Algorithm is one of the key algorithms. Until now, the Vernam Cipher algorithm is still trusted as an encryption method, Vernam Cipher cryptography uses the same key for encryption and decryption