Python实现SPN加密算法

Python实现SPN加密算法

参考:

密码学入门(一):用Python实现对称加密算法

《密码学原理与实践》


#S盒
S_Box = [0xE, 0x4, 0xD, 0x1, 0x2, 0xF, 0xB, 0x8,
         0x3, 0xA, 0x6, 0xC, 0x5, 0x9, 0x0, 0x7]
#P盒
P_Box = [1, 5, 9, 13, 2, 6, 10, 14, 3, 7, 11, 15, 4, 8, 12, 16]


def gen_K_list(K):
    """
    秘钥编排算法,由一个32比特秘钥生成5个16比特子秘钥
    :param K: 32比特秘钥
    :return: [k1,k2,k3,k4,k5],五个16比特子秘钥
    """
    Ks = []
    for i in range(5, 0, -1):
        ki = K % (2**16)
        Ks.insert(0, ki)
        K = K >> 4
    # for i in range(0, 5):
    #     print("".join(f"{Ks[i]:016b}"))
    return Ks


def pi_s(s_box, ur):
    """
    分组代换操作
    :param s_box:S盒参数
    :param ur:输入比特串,16比特
    :return:输出比特串,16比特
    """
    vr = 0
    for i in range(4):
        uri = ur % (2**4)
        vri = s_box[uri]
        vr = vr+(vri << (4*i))
        ur = ur >> 4
    return vr


def pi_p(p_box, vr):
    """
    单比特置换操作
    :param p_box:P盒参数
    :param vr:输入比特串,16比特
    :return:输出比特串,16比特
    """
    wr = 0
    for i in range(15, -1, -1):
        vri = vr % 2
        vr = vr >> 1
        wr = wr + (vri << (16-p_box[i]))
    return wr


def reverse_Sbox(s_box):
    """
    求S盒的逆
    :param s_box:S盒参数
    :return:S盒的逆
    """
    re_box = [-1]*16
    for i in range(16):
        re_box[s_box[i]] = i
    return re_box


def reverse_Pbox(p_box):
    """
    求P盒的逆
    :param s_box:P盒参数
    :return:P盒的逆
    """
    re_box = [-1]*16
    for i in range(16):
        re_box[p_box[i]-1] = i+1
    return re_box


def do_SPN(x, s_box, p_box, Ks):
    """
    :param x: 16比特输入
    :param s_box: S盒参数
    :param p_box: P盒参数
    :param Ks: [k1,k2,k3,k4,k5],五个16比特子秘钥
    :return: 16比特输出
    """
    wr = x
    for r in range(3):
        ur = wr ^ Ks[r]  # 异或操作
        vr = pi_s(s_box, ur)  # 分组代换
        wr = pi_p(p_box, vr)  # 单比特置换

    ur = wr ^ Ks[3]
    vr = pi_s(s_box, ur)
    y = vr ^ Ks[4]
    return y


def encrypt(K, x):
    """
    根据秘钥K对16比特明文x进行加密
    :param K:32比特秘钥
    :param x:16比特明文
    :return:16比特密文
    """
    Ks = gen_K_list(K)
    return do_SPN(x, S_Box, P_Box, Ks)


def decrypt(K, y):
    """
    根据秘钥K对16比特密文y进行解密。
    :param K:32比特秘钥
    :param y:16比特密文
    :return:16比特明文
    """
    Ks = gen_K_list(K)
    Ks.reverse()  # 密钥逆序编排

    Ks[1] = pi_p(P_Box, Ks[1])
    Ks[2] = pi_p(P_Box, Ks[2])
    Ks[3] = pi_p(P_Box, Ks[3])

    s_rbox = reverse_Sbox(S_Box)  # S盒求逆
    p_rbox = reverse_Pbox(P_Box)  # P盒求逆

    return do_SPN(y, s_rbox, p_rbox, Ks)


def encode(s):
    """
    字符转换为二进制编码
    """
    return ' '.join([bin(ord(c)).replace('0b', '') for c in s])


def decode(s):
    """
    二进制编码转换为字符
    """
    return ''.join([chr(i) for i in [int(b, 2) for b in s.split(' ')]])


if __name__ == '__main__':
    inStr = "你好"
    pCode = encode(inStr)

    #密钥
    K = 0b00111010100101001101011000111111
    pCodes = pCode.split(" ")
    print(pCodes[0])
    print(bin(int(pCodes[0], 2)))
    binPCode = [0]*len(pCodes)
    for i in range(len(pCodes)):
        binPCode[i] = int(pCodes[i], 2)

    C = [-1]*len(binPCode)
    P = [-1]*len(binPCode)
    Cs = ""
    Ps = ""
    for i in range(len(binPCode)):
        C[i] = encrypt(K, binPCode[i])
        Cs += format(C[i], '016b')+" "
    for i in range(len(binPCode)):
        P[i] = decrypt(K, C[i])
        Ps += str(bin(P[i])) + " "

    Ps = Ps.replace("0b", "")
    Ps = Ps.strip()

    Cs = Cs.replace("0b", "")
    Cs = Cs.strip()

    print("Cs:" + Cs)
    PP = decode(Ps)
    CC = decode(Cs)

    print('初始明文:', inStr)
    print('初始明文编码:', binPCode)
    print('加密密文编码:', C)
    print('加密密文:', CC)
    print('解密结果编码:', P)
    print('解密结果:', PP)

    # assert decrypt(K, encrypt(K, x)) == x



  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值