Categories

JavaScriptPHPHTMLCssPythonWordPressWeb developmentLinuxMySQLAndroidWindowsJavaC++ / C#LayoutReactUbuntuYiiDjangoProgramming1C-BitrixLaravelSystem administrationTelegramJSONDebianPostgreSQLIOSGoogleHtaccessWindows ServerGitMacOSGoogle ChromeCMSWooСommerceBootstrapNginxSQLUnityAPI
Make a leaderReport
C
C
curly_Paul2018-01-01 00:19:32
Encryption
curly_Paul, 2018-01-01 00:19:32

How to crack a small Vigenère cipher?

Faced with the problem of cracking the Vigenère cipher with a length of 47 letters, tried frequency analysis and mutual matching index, but they are all calculated for longer ciphers. I also tried brute-force but there are too many combinations.
It is known: the length of the key is 7 letters
The cipher itself:

Reply
Answer the question

Answer the question

In order to leave comments, you need to log in

0 answer(s)
Similar questions
V
Victor Marquardt2016-11-14 18:54:02
Diffie-Hellman algorithm, what should be the key length? 1Reply
E
Esmero2014-11-18 10:03:50
Does it make sense to purchase more than one CIPF distribution per organization? 4Reply
B
by_EL2020-01-02 14:14:00
How does asymmetric encryption protect against a type of replay attack? 2Reply
W
weredy2016-12-01 19:19:29
How exactly is the Diffie-Hellman session key obtained in the TLS protocol? 2Reply
L
lightalex2015-01-11 18:24:27
How is the code of known cms closed? 7Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question