Virginia无密钥解密

加密

virginia加密是一种多表替换加密方法，通过这种方法，可以有效的解决单表替换中无法应对的字母频度攻击。这种加密方法最重要的就是选取合适的密钥，一旦密钥被公开，保密性也就无从谈起。结合virginia加密原理，给出使用python实现的代码

plainText = "whenigotthethemeithoughtofgooglesartificialintelligencealphagothisprogramoverthebestofhumanplayeriwanttoaskwhenscienceandtechnologycontinuetodevelopwehumanbeingswillbewhatpositionweshouldrealizethatthedevelopmentofscienceandtechnologyisirreversibleanditconstituteaprimaryprductiveforcebutmanmustkeeppacewiththetimestoenhancetheablitytocontrol"  # 密文
alphabet = "abcdefghijklmnopqrstuvwxyz" # 26个字母
cipherText = "";
key = "helloworld" # 密钥
keyLen = len(key)
plainTextLen = len(plainText)
j = 0
for i in range(0,plainTextLen):j = i%keyLenkeyNum = alphabet.index(key[j])plainNum = alphabet.index(plainText[i])plainTemp = alphabet[(keyNum*plainNum)%26] # 密钥对明文作用cipherText += plainTemp
print(cipherText)

解密

重点谈谈解密部分。这里的解密主要分为获取密钥长度，根据密钥长度获取密钥，根据密钥获取明文三个部分。

获取密钥长度

使用暴力破解密钥长度的方法，循环遍历可能的密钥长度。每次循环中，记录在这种密钥长度下重复相隔密钥长度密文的次数，从理论上来讲，次数最多的那个密钥长度，最有可能正确。当密文长度足够长时，正确的可能性很高。给出获取密钥长度的python函数代码：

def getKeyLen(cipherText): # 获取密钥长度keylength = 1maxCount = 0for step in range(3,18): # 循环密钥长度count = 0for i in range(step,len(cipherText)-step):if cipherText[i] == cipherText[i+step]: count += 1if count>maxCount:  # 每次保存最大次数的密钥长度maxCount = count keylength = stepreturn keylength # 返回密钥长度

获取密钥

当已经获取密钥长度之后，我们可以通过分组将相同密钥作用下的密文进行分组，在每一组中，都是一个简单的单表替换加密。在这种情况下，我们通过重合指数法破解密钥，给出获取密钥部分的python函数代码：

def getKey(text,length): # 获取密钥key = [] # 定义空白列表用来存密钥alphaRate =[0.08167,0.01492,0.02782,0.04253,0.12705,0.02228,0.02015,0.06094,0.06996,0.00153,0.00772,0.04025,0.02406,0.06749,0.07507,0.01929,0.0009,0.05987,0.06327,0.09056,0.02758,0.00978,0.02360,0.0015,0.01974,0.00074]matrix =textToList(text,length)for i in range(length):w = [row[i] for row in matrix] #获取每组密文li = countList(w) powLi = [] #算乘积for j in range(26):Sum = 0.0for k in range(26):Sum += alphaRate[k]*li[k]powLi.append(Sum)li = li[1:]+li[:1]#循环移位Abs = 100ch = ''for j in range(len(powLi)):if abs(powLi[j] -0.065546)<Abs: # 找出最接近英文字母重合指数的项Abs = abs(powLi[j] -0.065546) # 保存最接近的距离，作为下次比较的基准ch = chr(j+97)key.append(ch)return key

破解明文

在已知密钥和明文的基础上，我们很容易就可以得到明文，给出python代码：

def virginiaCrack(cipherText): # 解密函数length = getKeyLen(cipherText) #得到密钥长度key = getKey(cipherText,length) #找到密钥keyStr = ''for k in key:keyStr+=kprint('the Key is:',keyStr)plainText = ''index = 0for ch in cipherText:c = chr((ord(ch)-ord(key[index%length]))%26+97)plainText += cindex+=1return plainText # 返回明文

代码

这是解密部分的全部代码，注意需要自己添加密文文件的位置

def virginiaCrack(cipherText): # 解密函数length = getKeyLen(cipherText) #得到密钥长度key = getKey(cipherText,length) #找到密钥keyStr = ''for k in key:keyStr+=kprint('the key:',keyStr)plainText = ''index = 0for ch in cipherText:c = chr((ord(ch)-ord(key[index%length]))%26+97)plainText += cindex+=1return plainText
def openfile(fileName): # 读文件file = open(fileName,'r')text = file.read()file.close();text = text.replace('\n','')return textdef getKeyLen(cipherText): # 获取密钥长度keylength = 1maxCount = 0for step in range(3,18): # 循环密钥长度count = 0for i in range(step,len(cipherText)-step):if cipherText[i] == cipherText[i+step]:count += 1if count>maxCount:maxCount = countkeylength = stepreturn keylengthdef getKey(text,length): # 获取密钥key = [] # 定义空白列表用来存密钥alphaRate =[0.08167,0.01492,0.02782,0.04253,0.12705,0.02228,0.02015,0.06094,0.06996,0.00153,0.00772,0.04025,0.02406,0.06749,0.07507,0.01929,0.0009,0.05987,0.06327,0.09056,0.02758,0.00978,0.02360,0.0015,0.01974,0.00074]matrix =textToList(text,length)for i in range(length):w = [row[i] for row in matrix] #获取每组密文li = countList(w) powLi = [] #算乘积for j in range(26):Sum = 0.0for k in range(26):Sum += alphaRate[k]*li[k]powLi.append(Sum)li = li[1:]+li[:1]#循环移位Abs = 100ch = ''for j in range(len(powLi)):if abs(powLi[j] -0.065546)<Abs: # 找出最接近英文字母重合指数的项Abs = abs(powLi[j] -0.065546) # 保存最接近的距离，作为下次比较的基准ch = chr(j+97)key.append(ch)return key                def countList(lis): # 统计字母频度li = []alphabet = [chr(i) for i in range(97,123)]for c in alphabet:count = 0for ch in lis:if ch == c:count+=1li.append(count/len(lis))return lidef textToList(text,length): # 根据密钥长度将密文分组textMatrix = []row = []index = 0for ch in text:row.append(ch)index += 1if index % length ==0:textMatrix.append(row)row = []return textMatrixif __name__ == '__main__':cipherText = openfile(r'') # 这里要根据文档目录的不同而改变plainText= virginiaCrack(cipherText)print('the plainText:\n',plainText)

Virginia（维吉尼亚）无密钥解密相关推荐

维吉尼亚密码加密/解密在线工具
维吉尼亚密码加密/解密在线工具,工具链接:http://www.atoolbox.net/Tool.php?Id=856 维吉尼亚密码是在凯撒密码基础上产生的一种加密方法,它将凯撒密码的全部25种位移 ...
实验吧-密码学-杯酒人生(特殊凯撒--维吉尼亚密码)(凯撒加解密脚本、维吉尼亚密码加解密脚本)...
题目: 使用古典密码一喵星人要想喵星发送一段不知道干什么用的密码"BLOCKCIPHERDESIGNPRINCIPLE", 但是它忘记了密钥是什么, 手头(爪头)只有它自己加密过 ...
维吉尼亚密码加解密与破解
实验目的 1.进一步理解维吉尼亚密码的加解密原理 2.进一步理解维吉尼亚密码的缺陷和利用方法 3.提高编程实践能力实验要求 1.实现维吉尼亚加解密函数 2.破解维吉尼亚加密的密文实验步骤 1.维吉 ...
python编写加密程序_python编写的维吉尼亚密码加解密程序
维吉尼亚密码表 ============================================= #维吉尼亚密码加密 key='helloworld' plaintext='whereis ...
Vigenere维吉尼亚密码加解密
1 相关公式及算法参考:https://slidesplayer.com/slide/17887679/ 源码:https://github.com/pp-tt/Vigenere 1.1 加密算法 ...
维吉尼亚密码加解密以及密文破解(某电密码学进展实验)
注:破解采用的是卡西斯基实验,博主水平有限,代码仅供参考学习 import string from itertools import cycle import numpy as np import r ...
用python实现维吉尼亚密码的加密与唯密文解密
目录加密过程加密原理代码加密的思路代码预览代码解析与运行效果唯密文解密过程解密原理代码预览代码分析与运行结果加密过程加密原理字母表中每一个字母都对应着一个数字,从A~ Z依次是 ...
密码学 | 维吉尼亚密码（Vigener）
1 单字母替换(前备知识) 在大量英文文献以及普通英文文章中,研究者发现这种文章中单词出现的频率符合一定的规律.如上表所示,例如a出现的频率在8.2%左右,e出现的频率最高,在12.4%左右.y.z频 ...
维吉尼亚密码破解过程
维吉尼亚密码破解过程问题分析利用重合指数攻击破解密钥长度维吉尼亚密码加解密算法的python3实现给定明文,进行维吉尼亚加密,将密文传给破解密钥的程序破解维吉尼亚密码密钥长度的python3 ...
Android实现信息安全中维吉尼亚密码技术
人们在单一恺撒密码的基础上扩展出多表密码,称为"维吉尼亚"密码.是法国密码学家维吉尼亚在1586年提出的一种多表替代密码,维吉尼亚密码引入了"密钥"的概念,即根 ...

Virginia（维吉尼亚）无密钥解密

Virginia无密钥解密

加密

解密

获取密钥长度

获取密钥

破解明文

代码

Virginia（维吉尼亚）无密钥解密相关推荐

最新文章

热门文章