一文了解栅栏密码

TEOGSDYUTAENN HLNETAMSHVAED

# Rail-Fence Cipher Encode Algorithm"""加密信息 THE LONGEST DAY MUST HAVE AN ENDkey = 2分栏第一栏：T E O G S D Y U T A E N N第二栏：H L N E T A M S H V A E D将第二栏的字母放在第一栏的后面，得到密文 TEOGSDYUTAENN HLNETAMSHVAED"""def splitString(string, step):    length = len(string)    count = length % step    if length % step != 0:        for i in range(step - count):            string += ' '    # 将字符串分隔成若干个子串, 子串最大长度为 key    return [string[i: i + step] for i in range(0, length, step)]if __name__ == '__main__':    string = str(input("Encode Info:"))    key = int(input("Key:"))    secret = ''    newString = string.replace(' ', '')    tempList = splitString(newString, key)    # 遍历二维数组, 取出每栏中的字符串    for i in range(key):        for j in range(len(tempList)):            secret += tempList[j][i]        secret += ' '    secretInfo = secret.replace(' ', '')    print("Encode-Secret:%s" % secretInfo)

# Rail-Fence Cipher Decode"""栅栏密码解密（即栅栏密码加密逆过程）解密思路如下：分栏计算长度等于最大长度的栏的个数和长度等于最小长度的栏的个数分栏之后执行加密的逆过程"""def splitString(string, step):    length = len(string)    if length % step == 0:        # 计算子串长度        childStringLength = int(length / step)        return childStringLength, [string[i : i + childStringLength] for i in range(0, length, childStringLength)]    else:        # 最大长度和最小长度之差恒等于1        minStringLength = int(length / step)        maxStringLength = minStringLength + 1        maxLengthCount = length % step        minLengthCount = step - maxLengthCount        maxStringLengthSum = (minStringLength + 1) * maxLengthCount        # 将长度等于最大长度的栏和长度等于最小长度的栏分离        maxStringSum = string[0 : maxStringLengthSum]        minStringSum = string[maxStringLengthSum : ]        # 将字符串彻底分栏        maxStringList = [maxStringSum[i : i + maxStringLength] for i in range(maxLengthCount)]        # 注意: 在分离最小长度栏时需要在每个子串后面加上空字符 ' ', 防止后面索引越界        minStringList = [minStringSum[i * minStringLength : i * minStringLength + minStringLength] + ' ' for i in range(minLengthCount)]        # minStringList = []        # for i in range(minLengthCount):        #     start = i * minStringLength        #     minStringList.append(minStringSum[start : start + minStringLength] + ' ')        #     # minStringList += minStringSum[start : start + minStringLength]        # 将最大长度栏集合和最小长度栏集合进行合并        stringList = maxStringList + minStringList        return maxStringLength, stringListif __name__ == '__main__':    encodeSecret = str(input("encodeSecret:"))    key = int(input("key:"))    childStringLength, tempList = splitString(encodeSecret, key)    secret = ''    for i in range(childStringLength):        for j in range(key):            secret += tempList[j][i]    secretInfo = secret.replace(' ', '')    print(secretInfo)