检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王伟闯 Wang Weichuang(Jiangsu Golden Shield Detection Technology Co.,Ltd.,Nanjing 210042,China)
机构地区:[1]江苏金盾检测技术股份有限公司,江苏南京210042
出 处:《无线互联科技》2023年第5期146-150,共5页Wireless Internet Technology
摘 要:对称加解密是保障传输数据安全的重要机制。对称加密技术具有高速、计算复杂度低的优点,但是安全性低于非对称加密机制。因此,在现代的数据安全传输过程中,一般使用非对称加解密与对称加解密相结合的来实现效率与安全性的均衡。但是,同时使用两种加密机制会带来密钥生成、分发与管理方面的问题。对此,文章提出一种基于SRv6协议实现的对称密钥生成和分发机制,该机制利用SRv6的路由机制来实现消息路由节点共同协商生成密钥,由此可以实现一次性对称加密密钥协商生成、分发与身份认证功能。相对于现有的机制,文章所提方案在安全性、便捷性方面具有突出优点。Symmetric encryption and decryption is an important mechanism to ensure the security of transmitted data.Symmetric encryption has the advantages of high speed and low computational complexity,but its security is lower than that of asymmetric encryption.Therefore,in the process of modern data security transmission,asymmetric encryption and decryption is generally used to achieve the balance between efficiency and security.However,using the two encryption mechanisms at the same time brings problems in key generation,distribution,and management.In this paper,a symmetric key generation and distribution mechanism based on SRv6 protocol is proposed.The mechanism uses the SRv6 routing mechanism to realize the message routing nodes to negotiate the key generation,distribution and identity authentication of one-time symmetric encryption key negotiation.Compared with the existing mechanism,the scheme proposed in this paper has outstanding advantages in security and convenience.
分 类 号:TP399[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.13