Vigenere Cipher 🔥🔥
Vložit
- čas přidán 15. 02. 2022
- This video is about Vigenere Cipher in Cryptography and system security or Network Security in Hindi.
In this lesson, I teach:
* Vigenere Cipher Encryption
* Vigenere Cipher in Hindi
Purchase notes right now,
more details below:
perfectcomputerengineer.teach...
Cryptography and System Security Playlist:
• Playlist to Cryptograp...
System Programming & Compiler Construction Playlist:
• Playlist to System Pro...
*Mobile Computing Playlist:
• Playlist to Mobile Com...
*Digital Signal & Image Processing Playlist:
• Digital Signal & Image...
* Artificial Intelligence:
• Playlist to Artificial...
*Gears used for this CZcams Channel:
linktr.ee/perfectcomputerengi...
*Let's connect:
Instagram: / planetojas
If P+K < 26 then key will remain same and if P+K > 26 then key = P+K - 26.
U made the MOD work so easy, don't even need a calculator :)
Not >26, it's >25*
Because we start assigning "a"=0
If it's 26, you don't need to calculate.. the answer is simply "a"
Love u bro u made a new formula love u
Thanks A LOT FOR THIS VIDEO, HELPFUL, EXAM IN 10 DAYS
Best explanation ever 🎉
The answer to the question is
ZICVTWQNGRZGVTW
Correct
Wrong
0:42
Correct answer
Thank you brother ❤
Thank you sir ❤
😊😊
Thank you
Thanks ❤
thank you
best ever
Perfect and too the point love from PK ❤
provide link for the watch you worn!!
Vernam and vigenere cipher techniques me kya differences hai
This js vernam cipher (one time pad )
voice is just like Amir Khan.
ans to correct hai lekin aolve krne me aaadha ghnta lag gyaaaa
mera kaal exam hain 😅🤣
what if key's length greater than the plain text's length ?
Double the plain text until it matches the length of key but most of time key is shorter the pt
ZICVTWQNGRZGVTW Answer to HW question.
Before last TW there is "Y" also
Home work question solution:
ZICVTWQNYRZGVTW
Cipher : z I c g x l d w f s x t I m y
sir this correcet ???
nope
import string
def alphabet_table():
alphabets_ = {}
alphabets = string.ascii_lowercase
for i, alphabet in zip(range(26), alphabets):
alphabets_[alphabet] = i
return alphabets_
def key_table():
keys = {}
alphabets = string.ascii_lowercase
for i, alphabet in zip(range(26), alphabets):
keys[i] = alphabet
return keys
def get_keys_for_alphabets(text):
return [alphabet_table()[char] for char in text]
def vigenere_cipher(text, key):
len_of_text = len(text)
len_of_key = len(key)
if len_of_text > len_of_key:
desired_length = len_of_text - len_of_key
padded_key = (key * ((desired_length // len(key)) + 1))[:desired_length]
new_key = key + padded_key
cipher_keys_list = get_keys_for_alphabets(new_key)
else:
cipher_keys_list = get_keys_for_alphabets(key)
plain_list = get_keys_for_alphabets(text)
cipher_text_list = [(p + k) % 26 for (p, k) in zip(plain_list, cipher_keys_list)]
cipher_chars = [key_table()[val] for val in cipher_text_list]
cipher_text = "".join(cipher_chars)
return cipher_text
if __name__ == "__main__":
print(vigenere_cipher("wearediscovered", "deceptive"))
Z I C O T W W N G R Z H V T W
hope i am right
no you are not
Z I C V T W Q N G R Z G V T W
This is the correct answer bro
@@omegajain3570 yes bro
Z I C V T W Q N G R Z G V Y T W