import re
class timeCode:
    __key=[] # 密鑰
    __apaMsg="" # 明文
    __secMsg="" #密文
    __lenKey=0 #密鑰長度 周期值
    def getKey(self,s): # 密鑰形成函數(shù)
        Key={}
        antiKey={}
        s=re.split(r'[()]',s) #以()分界
        while '' in s: # 消除''
            s.remove('')
        temp=[]
        for i in range(len(s)): 
            for j in range(len(s[i])-1):
                Key[int(s[i][j])]=int(s[i][j+1]) #密鑰字典
                antiKey[int(s[i][j+1])]=int(s[i][j]) #反密鑰字典
                temp.append(int(s[i][j])) #鑰匙收錄
            Key[int(s[i][-1])]=int(s[i][0]) #解決最后一個(gè)的問題
            antiKey[int(s[i][0])]=int(s[i][-1])
            temp.append(int(s[i][-1]))
        maxtemp=max(temp) #密鑰長度
        self.__lenKey=maxtemp
        lenKey={i+1 for i in range(maxtemp)} 
        sameKey=lenKey-set(temp) #找到?jīng)]有變化的密鑰
        for i in sameKey:
            Key[i]=i
            antiKey[i]=i
        self.__key.append(Key)
        self.__key.append(antiKey)
    def enCode(self,p): #加密函數(shù)
        self.__apaMsg=p
        Key=self.__key[0]
        time=self.__lenKey
        p=p.replace(' ','') #去除空格
        if len(p)%time != 0:
            p+=' '*(time-len(p)%time) #末尾補(bǔ)齊
        n=len(p)//time
        M=[p[i*time:(i+1)*time] for i in range(n)] #分組生成
        M=[M[i][Key[j+1]-1] for i in range(n) for j in range(time)] #矩陣轉(zhuǎn)換
        M=''.join(M) #列表轉(zhuǎn)換為字符串
        self.__secMsg=M
        return M
    def deCode(self,q):
        self.__apaMsg=p
        m=self.__lenKey
        n=len(q)//m
        Key=self.__key[1]
        M=[q[i*m:(i+1)*m] for i in range(n)]
        M=[M[i][Key[j+1]-1] for i in range(n) for j in range(m)]
        M=''.join(M)
        self.__secMsg=M
        return M
    def Print(self):
        print(self.__key,self.__apaMsg,self.__secMsg,self.__lenKey)
s='(15623)'
p='State Key Laboratory of Networking and Switching'
a=timeCode()
a.getKey(s)
q=a.enCode(p)
a.deCode(q)
a.Print()