检索结果-南通市图书馆

Elliptic Curve Quaternary Sequences Constructed Using the Reverse Gray Mapping

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2014年第3期23卷 448-453页

作者： wu chenhuang CHEN Zhixiong School of Mathematics Putian University

Quaternary sequences are the most important sequences in view of many practical applications. Using the reverse Gray mapping, we propose a new construction of elliptic curve quaternary sequences with strong pseudorandom properties. We apply a result of Marzouk and Winterhof on the relation between the pseudorandom measures for binary sequences and the measures for quaternary sequences to analyze the well-distribution measure and correlation measure of order, which were introduced by Mauduit and S′arkzy, for the proposed sequences.

关键词： Cryptography Pseudorandom quaternary sequences Elliptic curves Exponential sums Correlation

On the k-error linear complexity of binary sequences derived from polynomial quotients

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2015年第9期58卷 83-97页

作者： CHEN ZhiXiong NIU ZhiHua wu chenhuang School of Mathematics Putian University School of Computer Engineering and Science Shanghai University

The k-error linear complexity is an important cryptographic measure of pseudorandom sequences in stream ciphers. In this paper, we investigate the k-error linear complexity of p2-periodic binary sequences defined from the polynomial quotients modulo p, which are the generalizations of the well-studied Fermat ***, first we determine exact values of the k-error linear complexity over the finite field F2 for these binary sequences under the assumption of 2 being a primitive root modulo p2, and then we determine their k-error linear complexity over the finite field Fp. Theoretical results obtained indicate that such sequences possess‘good’ error linear complexity.

关键词： cryptography Fermat quotients polynomial quotients binary sequences linear complexity k-error linear complexity

Cryptanalysis and Improvement of a New Certificateless Signature Scheme in the Standard Model

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2021年第1期18卷 151-160页

作者： chenhuang wu Hui Huang Kun Zhou Chunxiang Xu School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China Key Laboratory of Financial Mathematics(Putian University) Fujian Province UniversityPutian 351100China School of computer Minnan Normal UniversityZhangzhou 363000China

Digital signature,as an important cryptographic primitive,has been widely used in many application scenarios,such as e-commerce,authentication,cloud computing,and so *** Public Key Cryptography(PKC)can get rid of the certificate management problem in the traditional Public Key Infrastructure(PKI)and eliminate the key-escrow problem in the identity-based ***,a new Certificateless Signature(CLS)scheme has been proposed by Kyung-Ah Shim(IEEE SYSTEMS JOURNAL,2018,13(2)),which claimed to achieve provable security in the standard ***,we present a concrete attack to demonstrate that the scheme cannot defend against the Type I *** this type of attack,the adversary can replace the public key of the signer,and then he plays the role of the signer to forge a legal certificateless signature on any ***,we give an improved CLS scheme to resist such an *** terms of the efficiency and the signature length,the improved CLS is preferable to the original scheme and some recently proposed CLS schemes in the case of precomputation.

关键词： certificateless signature standard model attack

On k-Error Linear Complexity of Some Explicit Nonlinear Pseudorandom Sequences

在线全文

学校读者我要写书评

暂无评论

wuhan University Journal of Natural Sciences 2008年第5期13卷 577-581页

作者： CHEN Zhixiong wu chenhuang Key Laboratory of Applied Mathematics Putian UniversityPutian 351100 Fujian China Key Laboratory of Network Security and Cryptology FujianNormal University Fuzhou 350007 Fujian China

Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences, we study the stability on linear complexity of two classes of explicit inversive generators and two classes of explicit nonlinear generators. We present some lower bounds in theory on the k-error linear complexity of these explicit generatol＇s, which further improve the cryptographic properties of the corresponding number generators and provide very useful information when they are applied to cryptography.

关键词： stream ciphers k-error linear complexity explicitinversive generators explicit nonlinear generators

Construction of k-ary Pseudorandom Elliptic Curve Sequences

在线全文

学校读者我要写书评

暂无评论

wuhan University Journal of Natural Sciences 2011年第5期16卷 452-456页

作者： wu chenhuang WENG Xin CHEN Zhixiong Department of Mathematics Putian University Putian351100 Fujian China State Key Laboratory of Information Security/Institute ofSoftware Chinese Academy of Sciences Beijing 100049 China School of Mathematics and Statistics Wuhan UniversityWuhan 430072 Hubei China

We present a method for constructing k-ary sequences over elliptic curves. Using the multiplicative character of order k of finite fields, we construct a family of k-ary pseudorandom elliptic curve sequences. The pseudorandom measures, such as the well-distribution measure, the correlation measure of order e, and the linear complexity are estimated by using certain character sums. Such sequences share the same order of magnitude on the well-distribution measure, the correlation measure of order e as the ＇truly＇ random sequences. The method indicates that it is possible to construct ＇good＇ pseudorandom sequences over elliptic curves widely used in public key cryptography.

关键词： pseudorandom sequences discrete logarithms elliptic curves character sums

在线全文

学校读者我要写书评

暂无评论

关于二元割圆序列的k-错线性复杂度

通信学报 2019年第2期40卷 197-206页

作者：陈智雄吴晨煌莆田学院福建省高校应用数学重点实验室福建莆田351100 电子科技大学计算机科学与工程学院四川成都611731

应用伪随机序列的离散傅里叶变换,讨论了周期为素数p的Legendre序列、Ding-Helleseth-Lam序列及Hall六次剩余序列的k-错线性复杂度。具体地,首先确定了上述3种序列的1-错线性复杂度,其次对k≥2,以及2模p的阶的一些特殊取值,讨论了相应... 详细信息

应用伪随机序列的离散傅里叶变换,讨论了周期为素数p的Legendre序列、Ding-Helleseth-Lam序列及Hall六次剩余序列的k-错线性复杂度。具体地,首先确定了上述3种序列的1-错线性复杂度,其次对k≥2,以及2模p的阶的一些特殊取值,讨论了相应序列的k-错线性复杂度。

关键词： Legendre序列 Ding-Helleseth-Lam序列 Hall六次剩余序列 k-错线性复杂度离散傅里叶变换

在线全文

学校读者我要写书评

暂无评论

周期为p^2的q元序列的k–错线性复杂度

通信学报 2019年第12期40卷 21-28页

作者：吴晨煌许春香杜小妮电子科技大学计算机科学与工程学院四川成都611731 莆田学院应用数学福建省高校重点实验室福建莆田351100 西北师范大学数学与统计学院甘肃兰州730070

基于矩阵中元素统计的方法,给出了计算周期为p2的q元序列k错线性复杂度的新方法,其中,p,q为奇素数且q为模p2的本原元。给出了一个一般性的结论及其证明,并通过列举2类周期为p2的q元序列及其实例来验证结论的正确性。该方法不需要迭代计... 详细信息

基于矩阵中元素统计的方法,给出了计算周期为p2的q元序列k错线性复杂度的新方法,其中,p,q为奇素数且q为模p2的本原元。给出了一个一般性的结论及其证明,并通过列举2类周期为p2的q元序列及其实例来验证结论的正确性。该方法不需要迭代计算,通过程序实现并与现有算法进行效率比较,结果表明所给出的新算法在计算周期为p2的q元序列的k错线性复杂度方面效率明显更高。

关键词：序列密码 q元序列 k错线性复杂度费马商序列广义割圆序列

Ding-Helleseth-Lam二元序列的迹表示

在线全文

学校读者我要写书评

暂无评论

莆田学院学报 2018年第2期25卷 1-8页

作者：吴晨煌莆田学院数学与金融学院电子科学技术大学计算机科学与工程学院

通过求序列的离散傅里叶变换给出了Ding-Helleseth-Lam二元序列的Mattson-Solomon多项式,并由此给出该序列的迹表示。所讨论的方法同样适用于其他阶割园类定义的序列。

关键词： Ding-Helleseth-Lam序列离散傅里叶变换 Mattson-Solomon多项式迹表示二元序列

在线全文

学校读者我要写书评

暂无评论

一个无证书代理盲签名方案的改进

计算机工程与应用 2011年第1期47卷 89-91页

作者：吴晨煌梁红梅陈智雄莆田学院数学与应用数学系福建莆田351100 福建师范大学网络安全与密码重点实验室福州350007 漳州师范学院数学与信息科学系福建漳州363000

无证书公钥系统克服了传统基于证书公钥系统中的证书管理问题和基于身份公钥系统中的密钥托管问题,是目前的研究热点之一。对陈虎等人新近提出的一个无证书代理盲签名方案进行了安全性分析,发现该签名方案存在严重的安全缺陷,即不诚实... 详细信息

无证书公钥系统克服了传统基于证书公钥系统中的证书管理问题和基于身份公钥系统中的密钥托管问题,是目前的研究热点之一。对陈虎等人新近提出的一个无证书代理盲签名方案进行了安全性分析,发现该签名方案存在严重的安全缺陷,即不诚实的用户能够恢复出代理签名人的代理私钥,从而能做代理签名人所能做的任何事情。最后,给出了一个克服该攻击的改进方法,并且改进后方案的安全性仍然是基于CDH问题。

关键词：无证书代理签名盲签名安全性双线性对