New Public Key Cryptosystems from Combinatorial Group Theory

0 IntroductionThe security of most commonly used cryptographicschemesis essentially based onthree families of compu-tational problems :the integer factoring problem(RSAprob-lem) ,the Diffie-Hell man problemand the discrete logarithmproblem,andthe elliptic curve variants thereof .Inthe middleof 1990s , Shor[1], Bonehet al[2]presented some remarkablequantumalgorithms which can solveinteger factoring problemand discrete logarithmproblemover any group including Ga-lois fields and elliptic curve…     

Dynamically Reconfigurable Encryption System of the AES

Reconfigurable computing has grown to become an important and large field of research, it offers advantages over traditional hardware and software implementations of computational algorithms. The Advanced Encryption Standard （AES） algorithm is widely applied in government department and commerce. This paper analyzed the AES algorithms with different cipher keys, adopted a novel key scheduler that generated the round key real-time, proposed a dynamically reconfigurable encryption system which supported the AES algorithm with different cipher keys, and designed the architecture of the reconfigurable system. The dynamically reconfigurable AES system had been realized on FPGA. The result proves that the reconfigurable AES system is flexible, lower cost and high security level.     

The Mechanism about Key and Credential on Trusted Computing Platform and the Application Study

0 IntroductionPeople need a secure and dependable computing environ-ment[1]. The cryptology is known as the core of com-puter security[2]. The application of cryptologyis mainly ful-filled by key management and credential mechanism.In thispaper , we should study the key management and credentialmechanismbased ontrusted computing platform,and give theactual application of these security mechanisms for buildingtrusted computing environment .1 OverviewTrusted Computing1 .1 The Original of Trus…     

Password-Based Group Key Agreement Protocol for Client-Server Application

0 IntroductionWith the rapid advances of computer networks , moreand more users are connecting together to exchangelarge amounts of information and share useful resources .However ,the security issue is still a major gating factor fortheir full adoption; mainly due to many malicious adversariesresidingin networked environments will eavesdrop,interceptand modify the transmittedinformation.The client-server model , over past years , has enjoyedsignificant and continually increasing popularity in…     

Improved Authenticated Multi-Key Agreement Protocol

Zhou et al give an attack on Ham＇s modified authenticated multi-key agreement protocol, and give a protocol that can prevent the unknown key-share attack. The paper points out that the protocol is vulnerable to a concatenation attack. This paper proposes an improved authenticated multi-key agreement protocol which shows how to make Harn＇s protocol more secure by modifying the signature and verification. And this protocol can escape the concatenation attack.     

在重点行业中实现污染物减排的途径

针对现有污染问题,结合各地的实际情况,提出在重点行业中实现污染物减排的途径。     

一种基于密钥分解理论的文件安全分割算法

提出了密钥分解问题的向量空间投影理论,由此给出了密钥分解算法,并且将该理论和算法引入文件分割问题的研究中,给出了一种应用于实际保密场合的文件安全分割及恢复算法,实现了将文件分割成n个子文件,而从其中任意m(1≤m≤n)个子文件恢复原文件的功能,为重要文件的存储和传输提供了安全保证.最后对在通信保密中实现信息的分解保密提出了建议.     

基于关键技术人员离职引发组织知识流失的离职研究视角

知识资源是企业核心能力的关键要素,关键技术员工是企业知识资源的重要载体。企业关键技术人员离职造成的企业知识流失问题,开始成为影响企业(尤其是知识密集型企业)生存与发展的重要问题。就此,对雇员离职和组织知识管理领域的理论研究进展分别进行评述,并指出当前雇员离职研究体系应根据关键技术员工特征及其离职对组织知识流失的影响做出相应拓展。     

Provable Efficient Certificateless Group Key Exchange Protocol

Certificateless public key cryptography （CL-PKC） avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our protocol is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol.     

Escrow-Free Certificate-Based Authenticated Key Agreement Protocol from Pairings

Key agreement protocols are essential for secure communications. In this paper, to solve the inherent key escrow problem of identity-based cryptography, an escrow-free certificate-based authenticated key agreement （CB-AK） protocol with perfect forward secrecy is proposed. Our protocol makes use of pairings on elliptic curves. The protocol is described and its properties are discussed though comparison with Smart＇s protocol.