检索结果-南通市图书馆

Pseudo-randomness of the fourth class of GSS sequences

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2004年第2期47卷 170-183页

作者： HU Yupu xiao guozhen ISNNationalKeyLaboratory XidianUniversityXi'an710071China

This paper discusses pseudo-randomness of a periodic sequence, named the fourth class of GSS sequence. We get the following results: ① Its least period always reaches the maximum (that is, 2n-1). ② Its least period and linear complexity keep robust under single-symbol-substitution. ③ It has good low-degree-auto-correlation feature. ④ It has good short-length-run-distribution.

关键词： GSS sequence m-sequence pseudo-randomness stream cipher.

Constructions of Cheating Immune Secret Sharing Functions

在线全文

学校读者我要写书评

暂无评论

High Technology Letters 2011年第1期17卷 102-105页

作者：卓泽朋 Zhang Weiguo xiao guozhen National Key Laboratory of ISN. Xidian University Xi＇ an 710071 P. R. China School of Mathematical Science Huaibei Coal Industry Normal College 235000 Huaibei P. R. China

Based on the relationship between cheating immune secret sharing and cryptographic criteria of Boolean functions, to design a cheating immune secret sharing scheme, a 1-resilient function satisfying the strict avalanche criterion （SAC） is needed. In this paper, a technique on constructing a cheating immune secret sharing function is studied. By using Maiorana-McFarland construction technique, two new methods to construct cheating immune secret sharing functions are proposed.

关键词： secret sharing Boolean function correlation immune strict avalanche criterion ( SAC) resilient function

The autocorrelation distribution of balanced Boolean function

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2013年第2期7卷 272-278页

作者： Yu ZHOU Weiguo ZHANG Juan LI Xinfeng DONG guozhen xiao Science and Technology on Communication Security Laboratory China Chengdu 610041 State Key Laboratory of Integrated Service Networks Xidian UniversityChina Xi'an 710071 Foreign Language Department Emei Campus Southwest Jiaotong University China Emei 614202 State Key Laboratory of Information Security Chinese Academy of SciencesChina Beijing 100093

The global avalanche characteristics （the sum- of-squares indicator and the absolute indicator） measure the overall avalanche characteristics of a cryptographic Boolean function. Sung et al. （1999） gave the lower bound on the sum- of-squares indicator for a balanced Boolean function satisfy- ing the propagation criterion with respect to some vectors. In this paper, if balanced Boolean functions satisfy the propaga- tion criterion with respect to some vectors, we give three nec- essary and sufficient conditions on the auto-correlation distri- bution of these functions reaching the minimum the bound on the sum-of-squares indicator. And we also find all Boolean functions with 3-variable, 4-variable, and 5-variable reaching the minimum the bound on the sum-of-squares indicator.

关键词： Boolean functions auto-correlation distribu-tion global avalanche characteristics balanced propagationcriterion

New field of cryptography: DNA cryptography

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Science Bulletin 2006年第12期51卷 1413-1420页

作者： xiao guozhen LU Mingxin QIN Lei LAI Xuejia National Key Lab of ISN Xidian University Xi'an 710071 China Queen's University Cancer Research Institute 10 Stuart St. Kingston ON K7L3N6 Canada Department of Computer Science & Engineer Shanghai JiaoTong University Shanghai 200030 China

DNA cryptography is a new born cryp- tographic field emerged with the research of DNA computing, in which DNA is used as information car- rier and the modern biological technology is used as implementation tool. The vast parallelism and ex- traordinary information density inherent in DNA molecules are explored for cryptographic purposes such as encryption, authentication, signature, and so on. In this paper, we briefly introduce the biological background of DNA cryptography and the principle of DNA computing, summarize the progress of DNA cryptographic research and several key problems, discuss the trend of DNA cryptography, and compare the status, security and application fields of DNA cryptography with those of traditional cryptography and quantum cryptography. It is pointed out that all the three kinds of cryptography have their own ad- vantages and disadvantages and complement each other in future practical application. The current main difficulties of DNA cryptography are the absence of effective secure theory and simple realizable method. The main goal of the research of DNA cryptography is exploring characteristics of DNA molecule and reac- tion, establishing corresponding theories, discovering possible development directions, searching for sim- ple methods of realizing DNA cryptography, and lay- ing the basis for future development.

关键词：密码术 DNA计算 DNA密码信息载体生物技术

Symmetric-key cryptosystem with DNA technology

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2007年第3期50卷 324-333页

作者： LU MingXin LAI XueJia xiao guozhen QIN Lei Department of Information Management Nanjing UniversityNanjing 210093China State Key Lab of Information Security Institute of Software of Chinese Academy of ScienceBeijing 100049China Department of Computer Science&Engineer Shanghai Jiao Tong UniversityShanghai 200030China State Key Lab of ISN Xidian UniversityXi’an 710071China Cancer Research Institute Queen’s UniversityKingstonOntarioK7L3N6Canada

DNA cryptography is a new field which has emerged with progress in the research of DNA computing. In our study, a symmetric-key cryptosystem was designed by applying a modern DNA biotechnology, microarray, into cryptographic technologies. This is referred to as DNA symmetric-key cryptosystem (DNASC). In DNASC, both encryption and decryption keys are formed by DNA probes, while its ciphertext is embedded in a specially designed DNA chip (microarray). The security of this system is mainly rooted in difficult biology processes and problems, rather than conventional computing technology, thus it is unaffected by changes from the attack of the coming quantum computer. The encryption process is a fabrication of a specially designed DNA chip and the decryption process is the DNA hybridization. In DNASC, billions of DNA probes are hybridized and identified at the same time, thus the decryption process is conducted in a massive, parallel way. The great potential in vast parallelism computation and the extraordinary information density of DNA are displayed in DNASC to some degree.

关键词： symmetric-key encryption DNA cryptography DNA computing

Constructions of new plateaued functions from known ones

在线全文

学校读者我要写书评

暂无评论

High Technology Letters 2008年第2期14卷 179-181页

作者：张卫国 Ding Yong Zhang Ning xiao guozhen State Key Laboratory of Integrated Service Networks Xidian University Xi＇an 710071 P.R. China School of Mathematics and Computational Science Guilin University of Electronic Technology Guilin 541004. P. R. Chinat

A number of methods for constructing new plateaued functions from known ones are *** combining the known plateaued functions it is possible to get highly nonlinear resilient *** order,resiliency and propagation characteristics of the constructed plateaued functions *** show the new functions could possess the desirable cryptographic property.

关键词： cryptography Boolean functions resilient propagation characteristics

Binary Sequences from a Pair of Elliptic Curves

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第6期11卷 1511-1515页

作者： CHEN Zhixiong ZHANG Ning xiao guozhen State Key Laboratory of Integrated Service Network Xidian University Xi＇an 710071 Shaanxi China Department of Mathematics Putian University Putian 351100 Fujian China

A family of binary sequences were constructed by using an elliptic curve and its twisted curves over finite fields. It was shown that these sequences possess ＂good＂ cryptographie properties of 0-1 distribution, long period and large linear complexity. The results indicate that such se quences provide strong potential applications in cryptography.

关键词： pseudo-random sequences elliptic curves stream ciphers elliptic curve cryptography

Elliptic Curve Scalar Multiplication with x-Coordinate

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2007年第1期12卷 163-166页

作者： ZHANG Ning PEI Qingqi xiao guozhen State Key Laboratory of Integrated Service Networks Xidian University Xi＇an 710071 Shaanxi China Ministry of Education Key Laboratory of ComputerNetworks and Information Security Xidian University Xi＇an710071 Shaanxi China

This paper gives a comprehensive method to do Elliptic Curve Scalar Multiplication with only x-coordinate. Explicit point operation formulae for all types of defining equations of the curves are derived. For each type of curve, the performance is analyzed. The formulae are applied in Montgomery Ladder to get scalar multiplication algorithm operated with only x-coordinate. The new scalar multiplication has the same security level and computation amount with protected binary scalar multiplication （PBSM） against side channel attack, and has the advantages of higher security and little memory needed.

关键词： elliptic curve scalar multiplication Montgomery ladder x-coordinate

A Signature Scheme with Non-Repudiation

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第5期11卷 1249-1252页

作者： XIN Xiangjun GUO xiaoli xiao guozhen State Key Laboratory of Integrated Service Networks Xidian University Xi＇an 710071 Shaanxi China Department of Information and Computing Science Zhengzhou University of Light Industry Zhengzhou 450002Henan China

Based on the Schnorr signature scheme, a new signature scheme with non-repudiation is proposed. In this scheme, only the signer and the designated receiver can verify the signature signed by the signer, and if necessary, both the signer and the designated receiver can prove and show the validity of the signature signed by the signer. The proof of the validity of the signature is noninteractive and transferable. To verify and prove the validity of the signature, the signer and the nominated receiver needn＇t store extra information besides the signature. At the same time, neither the signer nor the designated receiver can deny a valid signature signed. Then, there is no repudiation in this new signature scheme. According to the security analysis of this scheme, it is found the proposed scheme is secure against existential forgery on adaptive chosen message attack.

关键词： digital signature Schnorr signature non-repudiation