Cryptalk Levels 2 & 3: Secure One-Time Pad Encryption π
Demo of Cryptalk's Level 2 user verification and Level 3 unbreakable one-time pad encryption for enhanced security.

CrypTalk
243 views β’ Dec 27, 2017

About this video
A brief demonstration on how to establish level 2 (User identity verification) and level 3 (one time pad, brute force immune, encryption) in the Cryptalk chat app. This is purely for demonstration purposes, and may vary depending on phone models.
This option currently cannot be established cross platform (one user is android and the other iOS).
Why OTP?
β’ Conventional symmetric encryption algorithms use complex patterns of substitution and transpositions but it is not known whether there can be a cryptanalytic procedure which can reverse them.
β’ Asymmetric encryption algorithms depend on mathematical problems that are THOUGHT to be difficult to solve. However, there is no proof that these problems are hard, and a mathematical breakthrough could make existing systems vulnerable to attack.
β’ On the other hand, One Time Pad is "information-theoretically secure". The encrypted message provides no Information about the original message to a cryptanalyst (except the maximum possible length of the message).
β’ OTP is immune even to brute-force attacks. It is secure even against adversaries with infinite computational power.
A priori probability of a plaintext message M is the same as the a posteriori probability of a plaintext message M given the corresponding ciphertextH(M) = H(M|C) where H(M) is the entropy of the plaintext and H(M|C) is the conditional entropy of the plaintext given the ciphertext C.
For more information visit www.cryptalk.me
This option currently cannot be established cross platform (one user is android and the other iOS).
Why OTP?
β’ Conventional symmetric encryption algorithms use complex patterns of substitution and transpositions but it is not known whether there can be a cryptanalytic procedure which can reverse them.
β’ Asymmetric encryption algorithms depend on mathematical problems that are THOUGHT to be difficult to solve. However, there is no proof that these problems are hard, and a mathematical breakthrough could make existing systems vulnerable to attack.
β’ On the other hand, One Time Pad is "information-theoretically secure". The encrypted message provides no Information about the original message to a cryptanalyst (except the maximum possible length of the message).
β’ OTP is immune even to brute-force attacks. It is secure even against adversaries with infinite computational power.
A priori probability of a plaintext message M is the same as the a posteriori probability of a plaintext message M given the corresponding ciphertextH(M) = H(M|C) where H(M) is the entropy of the plaintext and H(M|C) is the conditional entropy of the plaintext given the ciphertext C.
For more information visit www.cryptalk.me
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
243
Likes
6
Duration
1:52
Published
Dec 27, 2017