希尔密码_密码学中的希尔密码

最新推荐文章于 2023-04-19 21:32:27 发布

cumtv80668

最新推荐文章于 2023-04-19 21:32:27 发布

阅读量7.9k

点赞数 1

文章标签：密码学 python 算法人工智能机器学习

原文链接：https://www.includehelp.com/cryptography/hill-cipher.aspx

版权

希尔密码是一种依赖于线性代数的多字母替换密码，通过将字母映射到模26的数值进行加密和解密。加密时，将n个字母的块乘以一个可逆的n×n矩阵；解密时，乘以该矩阵的逆。文章以加密和解密消息'ACT'为例，展示了希尔密码的工作原理。虽然基本的希尔密码易受已知明文攻击，但矩阵乘法与其他非线性运算结合可以提供更好的安全性。

摘要由CSDN通过智能技术生成

希尔密码

It is a polygraphic substitution cipher that depends on linear algebra. Every letter from the alphabet is represented by several modulo 26. Simply, we write as A = 0, B = 1, ..., Z = 25 is used, but this is not a correct feature of the cipher.

这是一个依赖于线性代数的测谎替代密码。字母表中的每个字母都由26为模。简单地，我们写为A = 0，B = 1，...，Z = 25 ，但这不是密码的正确特征。

To encrypt a message, each block of n letters is multiplied by an invertible n × n matrix, against modulus 26 or we can say the multiple inverses of n.

为了加密消息，将n个字母的每个块都乘以可逆n×n矩阵(模数为26)或我们可以说n的多个逆。

To decrypt the message, every block is multiplied by the inverse of the matrix or inversed matrix used for encryption.

为了解密该消息，将每个块乘以用于加密的矩阵或逆矩阵的逆。

The matrix used for encryption is the plain text and one matrix is formed is cipher key when we combine or multiple them we get the new matrix called ciphertext, and the key should be chosen randomly from the set of invertible n × n matrices (modulo 26).

用于加密的矩阵是纯文本，当我们将它们组合或相乘时，形成的一个矩阵是密码密钥，得到一个新的矩阵，称为密文，密钥应从可逆n×n矩阵集中随机选择(取模26 )。

加密 (Encryption)

We have to do encryption on the message 'ACT' (n=3). The key is 'GYBNQKURP' which can be written as the n x n matrix that is 3 x 3 matrix,

我们必须对消息“ ACT”(n = 3)进行加密。关键是“GYBNQKURP”，其可以被写为NxN矩阵是3×3矩阵，