南强小屋 Design By 杰米
本文实例为大家分享了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%keyLen keyNum = alphabet.index(key[j]) plainNum = alphabet.index(plainText[i]) plainTemp = alphabet[(keyNum*plainNum)%26] # 密钥对明文作用 cipherText += plainTemp print(cipherText)
解密
重点谈谈解密部分。这里的解密主要分为获取密钥长度，根据密钥长度获取密钥，根据密钥获取明文三个部分。
获取密钥长度
使用暴力破解密钥长度的方法，循环遍历可能的密钥长度。每次循环中，记录在这种密钥长度下重复相隔密钥长度密文的次数，从理论上来讲，次数最多的那个密钥长度，最有可能正确。当密文长度足够长时，正确的可能性很高。给出获取密钥长度的python函数代码：
def getKeyLen(cipherText): # 获取密钥长度
keylength = 1
maxCount = 0
for step in range(3,18): # 循环密钥长度
count = 0
for i in range(step,len(cipherText)-step):
if cipherText[i] == cipherText[i+step]:
count += 1
if count>maxCount: # 每次保存最大次数的密钥长度
maxCount = count
keylength = step
return 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.0
for k in range(26):
Sum += alphaRate[k]*li[k]
powLi.append(Sum)
li = li[1:]+li[:1]#循环移位
Abs = 100
ch = ''
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+=k
print('the Key is:',keyStr)
plainText = ''
index = 0
for ch in cipherText:
c = chr((ord(ch)-ord(key[index%length]))%26+97)
plainText += c
index+=1
return plainText # 返回明文
代码
这是解密部分的全部代码，注意需要自己添加密文文件的位置
def virginiaCrack(cipherText): # 解密函数
length = getKeyLen(cipherText) #得到密钥长度
key = getKey(cipherText,length) #找到密钥
keyStr = ''
for k in key:
keyStr+=k
print('the key:',keyStr)
plainText = ''
index = 0
for ch in cipherText:
c = chr((ord(ch)-ord(key[index%length]))%26+97)
plainText += c
index+=1
return plainText
def openfile(fileName): # 读文件
file = open(fileName,'r')
text = file.read()
file.close();
text = text.replace('\n','')
return text
def getKeyLen(cipherText): # 获取密钥长度
keylength = 1
maxCount = 0
for step in range(3,18): # 循环密钥长度
count = 0
for i in range(step,len(cipherText)-step):
if cipherText[i] == cipherText[i+step]:
count += 1
if count>maxCount:
maxCount = count
keylength = step
return keylength
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.0
for k in range(26):
Sum += alphaRate[k]*li[k]
powLi.append(Sum)
li = li[1:]+li[:1]#循环移位
Abs = 100
ch = ''
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 = 0
for ch in lis:
if ch == c:
count+=1
li.append(count/len(lis))
return li
def textToList(text,length): # 根据密钥长度将密文分组
textMatrix = []
row = []
index = 0
for ch in text:
row.append(ch)
index += 1
if index % length ==0:
textMatrix.append(row)
row = []
return textMatrix
if __name__ == '__main__':
cipherText = openfile(r'') # 这里要根据文档目录的不同而改变
plainText= virginiaCrack(cipherText)
print('the plainText:\n',plainText)
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持。
南强小屋 Design By 杰米
广告合作：本站广告合作请联系QQ：858582 申请时备注：广告合作（否则不回）
免责声明：本站文章均来自网站采集或用户投稿，网站不提供任何软件下载或自行开发的软件！ 如有用户或公司发现本站内容信息存在侵权行为，请邮件告知！ 858582#qq.com
免责声明：本站文章均来自网站采集或用户投稿，网站不提供任何软件下载或自行开发的软件！ 如有用户或公司发现本站内容信息存在侵权行为，请邮件告知！ 858582#qq.com
南强小屋 Design By 杰米
暂无python实现Virginia无密钥解密的评论...
《魔兽世界》大逃杀！60人新游玩模式《强袭风暴》3月21日上线
暴雪近日发布了《魔兽世界》10.2.6 更新内容，新游玩模式《强袭风暴》即将于3月21 日在亚服上线，届时玩家将前往阿拉希高地展开一场 60 人大逃杀对战。
艾泽拉斯的冒险者已经征服了艾泽拉斯的大地及遥远的彼岸。他们在对抗世界上最致命的敌人时展现出过人的手腕，并且成功阻止终结宇宙等级的威胁。当他们在为即将于《魔兽世界》资料片《地心之战》中来袭的萨拉塔斯势力做战斗准备时，他们还需要在熟悉的阿拉希高地面对一个全新的敌人──那就是彼此。在《巨龙崛起》10.2.6 更新的《强袭风暴》中，玩家将会进入一个全新的海盗主题大逃杀式限时活动，其中包含极高的风险和史诗级的奖励。
《强袭风暴》不是普通的战场，作为一个独立于主游戏之外的活动，玩家可以用大逃杀的风格来体验《魔兽世界》，不分职业、不分装备（除了你在赛局中捡到的），光是技巧和战略的强弱之分就能决定出谁才是能坚持到最后的赢家。本次活动将会开放单人和双人模式，玩家在加入海盗主题的预赛大厅区域前，可以从强袭风暴角色画面新增好友。游玩游戏将可以累计名望轨迹，《巨龙崛起》和《魔兽世界：巫妖王之怒 经典版》的玩家都可以获得奖励。