Three-party password authenticated key agreement protocol with user anonymity based on lattice

With the rapid development of quantum theory and the existence of polynomial algorithm in quantum computation based on discrete logarithm problem and large integer decomposition problem,the security of the algorithm was seriously threatened.Therefore,two authentication key agreement protocols were proposed rely on ring-learning-with-error (RLWE) assumption including lattice-based implicit authentication key agreement scheme and lattice-based explicit authentication key agreement scheme and proved its security.The implicit authentication key agreement protocol is less to communicate and faster to authentication,the explicit authentication key agreement protocol is more to secure.At the same time,bidirectional authentication of users and servers can resist unpredictable online dictionary attacks.The new protocol has higher efficiency and shorter key length than other password authentication key agreement protocols.It can resist quantum attacks.Therefore,the protocol is efficient,secure,and suitable for large-scale network communication.     

基于DLP的自认证盲签密方案

盲签密指盲签密者对其所签署的信息是不可见的,而且签密消息不可跟踪。有机集成自认证公钥密码系统和盲签密思想,提出了一个新的基于离散对数问题（DLP）的自认证盲签密方案。所提方案具有盲签密的各种安全特性;权威机构不知道用户私钥;不需要对用户的公钥进行单独认证;具有计算效率高、通信成本低、安全性强和算法简单等优点,适合于在电子商务和电子政务中应用。     

遗传算法在信息安全中的应用研究

遗传算法作为一种高效、并行、全局搜索的现代仿生智能优化算法,被广泛应用于计算机、自动控制等领域。探讨了遗传算法与S盒的基本原理,构造出基于遗传算法的S盒密码学模型,同时对该模型的理论基础、收敛性等进行了系统的分析;通过仿真实验对该模型效果和性能进行了分析与验证,结果表明该模型具有良好的密码学性能。     

Computing the k-error joint linear complexity of binary periodic multisequences

Complexity measures for multisequences over finite fields, such as the joint linear complexity and the k-error joint linear complexity, play an important role in cryptology. In this paper we study a fast algorithm, presented by Venkateswarlu A, to computer the k-error joint linear complexity of a binary periodic multisequence. In this paper, the aim is mainly to complement the theoretical derivation and proof of the existing algorithm. Moreover, our algorithm reduces computation.     

Reparable Key Distribution Protocols for Internet Environments

It has claimed that any practical way to achieve perfect reparability for key distribution protocol (KDP) could only be futile. Fortunately, this paper presents reparable KDPs for internet environments with the use of the concept of timestamps.     

Z[ω]环上的两类密码体制

本文在Eisenstein环Z[ω]上得到了两类新的密码体制。它们分别是推广的RSA密码体制和自确认密码体制。安全性分别基于环Z[ω]上整数的分解和Z[ω]环上离散对数的计算。     

对环Z/nZ上圆锥曲线RSA型公钥密码体系的小私钥d攻击

为讨论环Z/nZ上圆锥曲线RSA型公钥密码体制的安全性,研究了对其的小私钥d攻击方法.给出了基于连分数方法分解n的算法,并通过两个简单的例子对该攻击方法进行了说明.由此指出Z/nZ上圆锥曲线RSA型公钥密码体制不能抵抗小私钥攻击,即在私钥d过小时,环Z/nZ上圆锥曲线RSA型公钥密码体制是不安全的.     

网络信息安全中密码算法的应用研究

当今是科技信息时代,计算机网络技术已渗透到社会的方方面面,成为推动现代文明进程的重要因素。但随之产生的网络安全问题也日益显现,强调了网络安全技术的不断更新与构建。本文对数据加密技术进行了综述,并着重阐述了两种典型加密算法,旨在强化对密码算法的认识,为今后相关领域的研究提供一定的参考资料。     

THE VIEM FROM ACROSS THE POND AN INTERVIEW WITH THE GENEVA MANAGEMENT GROUP

We consider the use of genetic algorithms (GAs) as powerful tools in the breaking of cryptographic systems. We show that GAs can greatly facilitate cryptanalysis by efficiently searching large keyspaces, and demonstrate their use with GENALYST, an order-based GA for breaking a classic cryptographic system.     

NEEDLES AND HAYSTACKS: THE SEARCH FOR ULTRA IN THE 1930'S (AN EXCERPT)

This thesis traces the efforts in the 1930's of the Polish, French, and British Intelligence Services to break the German Enigma ciphering machine, efforts which led to the Bletchley Park Ultra operations of World War II. The cooperation, and lack thereof, among the intelligence services is discussed, with the conclusion that more cooperation sooner would have better served the individual national interest of each.