检索结果-南通市图书馆

Research on applying physical chaos generator to spacecraft information security

在线全文

学校读者我要写书评

暂无评论

Science china.Technological Sciences) 2009年第5期52卷 1463-1470页

作者： ZHAO HePing state key lab.ratory of information security,Graduate University of Chinese Academy of Sciences,beijing 100049,china.china.Academy of Space Technology,beijing 100094,china state key lab.ratory of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China china.Academy of Space Technology Beijing 100094 China

The effectiveness of a short-length message extension method based on physical chaos generator was analyzed and the entropy of the extended message was calculated in this *** analysis demon-strated that with the mentioned method the entropy of short-length messages,which are repeatedly used in spacecraft data systems,is obviously increased,and the security of transmission is enhanced as *** paper also presented an improvement of the protocol for secret key agreement presented by *** and *** of depending on characteristics of communication channel,this method takes advantage of the random data produced by physical chaos generator to preset the initial parameters of the procedure on both sides of communication,so that the procedure and quantity of cipher key can be precisely *** method can be used to cipher key management of se-cure communication between long life-span spacecraft and ground system.

关键词： physical chaos generator spacecraft information security message extension cipher key management

A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over Galois rings

在线全文

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2006年第9期16卷 998-1001页

作者： HU Lei and SUN Nigang (state key lab.ratory of information security, Graduate School of Chinese Academy of Sciences, beijing 100049, china. [a]state key lab.ratory of information security Graduate School of Chinese Academy of Sciences Beijing China

Using a polynomial expression of the highest coordinate map, we deduce an exact formula on the linear complexity of the highest coordinate sequence derived from a maximal periodic sequence over an arbitrary Galois ring of characteristic p2 , where p is a prime. This generalizes the known result of Udaya and Siddiqi for the case that the Galois ring is Z4.

关键词： Galois ring highest coordinate sequence linear complexity.

Round-optimal zero-knowledge proofs of knowledge for NP

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china.information Sciences) 2012年第11期55卷 2473-2484页

作者： LI HongDa1,FENG DengGuo2,LI Bao1 & XUE HaiXia1 1state key lab.of information security,Graduate University of Chinese Academy of Sciences,beijing 100049,china.2state key lab.of information security,Institute of software of Chinese Academy of Sciences,beijing 100080,china 1. state key lab.of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China2. State Key Lab of Information Security Institute of software of Chinese Academy of Sciences Beijing 100080 China

It is well known that all the known black-box zero-knowledge proofs of knowledge for NP are *** there exit constant-round black-box zero-knowledge proofs of knowledge for all NP languages under certain standard assumptions is an open *** paper focuses on the problem and gives a positive answer by presenting two constructions of constant-round(black-box) zero-knowledge proofs of knowledge for the HC(hamiltonian cycle) *** the recent result of Katz,our second construction which relies on the existence of claw-free functions has optimal round complexity(5-round) assuming the polynomial hierarchy does not collapse.

关键词： zero-knowledge proofs proofs of knowledge black-box simulation constant-round

Paillier's trapdoor function hides Θ(n) bits

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china.information Sciences) 2011年第9期54卷 1827-1836页

作者： SU Dong & Lü KeWei state key lab.ratory of information security,Graduate University of Chinese Academy of Sciences,beijing 100049,china 1. state key lab.ratory of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China

In this paper,we re-examine the bit security of Paillier’s trapdoor *** show that given a random w=gcyN mod N2 ∈ZN2* the most significant bit of its class c is a hard-core predicate,under a standard assumption that is computing composite residuosity class is *** the simultaneous security,we prove that n number of the class c’s bits are simultaneously hard-core under the standard assumption,where n is the length of c.

关键词： Paillier’s trapdoor function hard-core predicate hard-core function simultaneous security most significant bit

Analysis of a kind of quantum cryptographic schemes based on secret sharing

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china.Physics,Mechanics & Astronomy) 2009年第9期52卷 1313-1316页

作者： ZHANG XingLan1 & JI DongYao2 1 College of Computer Science and Technology, beijing University of Technology, beijing 100124, china.2 state key lab.ratory of information security, Graduate University of Chinese Academy of Sciences, beijing 100049, china College of Computer Science and Technology Beijing University of Technology Beijing 100124 China state key lab.ratory of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China

Recently, Yang et al. proposed a kind of quantum cryptographic schemes based on secret sharing. The main idea is drawn from the case, where any n participants who share a secret K can co-operate as K does. This process can be applied to encryption, authentication, signature and so on. Unfortunately, since there is no identity authentication of the share's holder, these schemes inherit the limitation of secret sharing in practice. If some participants do not follow the protocol, the protocol would be a failure at last. Moreover, these schemes encounter another serious attack. Any two participants can co-operate to defeat the schemes by sending different shares to the parties unknown to the distributor of the secret K, such that these parties can execute the protocol as well. The attack proves that it is not enough for quantum cryptographic schemes that only the secret key is secure.

关键词： quantum identity authentication quantum secure direct communication quantum signature secret sharing

Nondegenerative ML-sequences over ring Z/(2~e)

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1999年第17期44卷 1557-1561页

作者： YANG Junhui and ZHAI QibinInstitute of Software , Chinese Academy of Sciences , beijing 100080, china.state key lab.ratory of information security , beijing 100080, china Chinese Acad Sci Inst Software Beijing 100080 Peoples R China state key lab.Informat Secur Beijing 100080 Peoples R China

The so-called quasi-period of an ML-sequence has been introduced. It is noted that an ML-sequence may degenerate in the sense that it has the quasi-period shorter than its period, and the problem of constructing the n... 详细信息

关键词： nondegenerate ML-sequence quasi-period.

On constant-round zero-knowledge proofs of knowledge for NP-relations

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science china.information Sciences) 2010年第4期53卷 788-799页

作者： LI HongDa1*, XU HaiXia1, LI Bao1 & FENG DengGuo2 1state key lab.ratory of information security, Graduate University of Chinese Academy of Sciences, beijing 100049, china.2state key lab.ratory of information security, Institute of Software of Chinese Academy of Sciences, beijing 100080, china 1. state key lab.ratory of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China2. State Key Laboratory of Information Security Institute of Software of Chinese Academy of Sciences Beijing 100080 China

This paper considers the existence of constant-round zero-knowledge proofs of knowledge for NP under standard assumptions. By introducing a new interactive proof model, we construct a 3-round zero-knowledge proof of knowledge system for the NP-relation under the assumption that factoring is intractable. Our construction not only shows the existence of constant-round zero-knowledge proofs of knowledge, but also gives a positive answer to the open problem of the existence of 3-round zero-knowledge proofs for NP.

关键词： zero-knowledge proof proof of knowledge constant-round NP-relation

Refined Convergents to the Associated Continued Fractions for Binary Sequences

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 1994年第2期10卷 179-191页

作者： Dai Zongduo Zeng Kencheng state key lab.ratory of information security Academia Sinica beijing, 100039 china 1. state key lab.ratory of information security Academia Sinica 100039 Beijing China

The relation between continued fractions and Berlekamp’s algorithm was studied by some reseachers. The latter is an iterative procedure proposed for decoding BCH codes. However, there remains an unanswered question whether each of the iterative steps in the algorithm can be interpreted in terms of continued fractions. In this paper, we first introduce the so-called refined convergents to the continued fraction expansion of a binary sequence s, and then give a thorough answer to the question in the context of Massey’s linear feedback shift register synthesis algorithm which is equivalent to that of Berlekamp, and at last we prove that there exists a one- to-one correspondence between the n-th refined convergents and the length n segments.

关键词： Refined Convergents to the Associated Continued Fractions for Binary Sequences

CMQV+:An authenticated key exchange protocol from CMQV

在线全文

学校读者我要写书评

暂无评论

Science china.information Sciences) 2012年第7期55卷 1666-1674页

作者： LI Hui 1,2 & WU ChuanKun 1 1 state key lab.ratory of information security,Institute of Software,Chinese Academy of Sciences,beijing 100190,china.2 Graduate University of Chinese Academy of Sciences,beijing 100049,china 1. state key lab.ratory of information security Institute of Software Chinese Academy of Sciences Beijing 100190 China2. Graduate University of Chinese Academy of Sciences Beijing 100049 China

Ustaoglu presents a secure and efficient key exchange protocol named CMQV,based on the design rationales of HMQV and *** with the latter two protocols,on one hand,CMQV achieves high performance of HMQV,and on the other,it is proven secure in eCK model as NAXOS ***,CMQV enjoys the security proof under gap Diffie-Hellman assumption as indicated by its *** this paper,we propose a variant of CMQV,called CMQV+,which is proven secure under a weaker assumption (*** Diffie-Hellman assumption) in eCK model with random oracles while maintaining the high-performance feature of CMQV as much as possible.

关键词： key exchange eCK model trapdoor-test technique provable security CDH assumption