素数元旋转对称弹性布尔函数的构造与计数

通过对素数元旋转对称弹性布尔函数特征矩阵的研究,给出了其特征矩阵的若干性质,得到了素数元旋转对称布尔函数为弹性函数的一个充要条件,由此完全决定了旋转对称弹性函数的构造以及这类函数的精确计数公式,最后还给出了所有的三元、五元、七元旋转对称弹性布尔函数的构造方案与精确计数。     

Quantum algorithm for neighborhood preserving embedding

Neighborhood preserving embedding (NPE) is an important linear dimensionality reduction technique that aims at preserving the local manifold structure. NPE contains three steps, i.e., finding the nearest neighbors of each data point, constructing the weight matrix, and obtaining the transformation matrix. Liang et al. proposed a variational quantum algorithm (VQA) for NPE [Phys. Rev. A 101 032323 (2020)]. The algorithm consists of three quantum sub-algorithms, corresponding to the three steps of NPE, and was expected to have an exponential speedup on the dimensionality n. However, the algorithm has two disadvantages: (i) It is not known how to efficiently obtain the input of the third sub-algorithm from the output of the second one. (ii) Its complexity cannot be rigorously analyzed because the third sub-algorithm in it is a VQA. In this paper, we propose a complete quantum algorithm for NPE, in which we redesign the three sub-algorithms and give a rigorous complexity analysis. It is shown that our algorithm can achieve a polynomial speedup on the number of data points m and an exponential speedup on the dimensionality n under certain conditions over the classical NPE algorithm, and achieve a significant speedup compared to Liang et al.'s algorithm even without considering the complexity of the VQA.     

高效的可证明安全的无证书聚合签名方案

利用双线性对构造了一个高效的无证书聚合签名方案,在随机预言机模型下给出了方案的安全性证明,其安全性基于计算Diffie-Hellman难题.与已有的无证书聚合签名方案相比,本文方案更能提高签名验证与传输效率,因聚合签名的验证只需要计算4个双线性对,签名的长度是固定的,仅有320bits,是目前最短的无证书聚合签名.     

2阶相关免疫函数的构造与计数

本文讨论２阶相关免疫函数的构造与计数问题，构造出了一大类重量为２的方幂的２阶相关免疫函数，首次给出了２阶相关免疫函数个数的下界。     

量子加密算法的研究

本文研究如何加密量子消息,综述了近几年的研究进展,并分别介绍使用经典密钥和量子密钥的量子加密方法,讨论了量子加密算法和量子隐形传态之间的联系。     

新的三元零相关区二维阵列集

提出了一类新的三元零相关区二维阵列集的构造方法.新的阵列集可由任意一对Hadamard阵生成,并且在零相关区内,其周期相关函数和非周期相关函数都为0.构造的二维阵列集中包含的阵列数目接近Tang-Fan-Matsufuji界,其性能参数达到了近似理想的状态.     

一类基于填充设计的LDPC码的构造

文中利用填充设计,构造了一类具有特定结构的任意码长的LDPC(低密度校验)码,这类LDPC码不仅具有好的最小距离,其Tanner图的最小周长为6,而且它的编码和译码结构可通过移位寄存器线性产生,其性能优于随机产生的LD-PC码。     

基于辫子群的密码体制研究及进展

综述了基于辫子群的密码体制的研究成果和发展状况:介绍了现有的基于辫子群的一些密码体制,包括密钥交换协议,加密-解密方案和身分认证方案,同时也概述了相关的密码分析方法,如解共轭问题、基于长度和线性表示的攻击等.指出了目前基于辫子群的密码体制所存在的问题,并对其研究前景进行了展望.     

An Economical Scheme for Cloning an Unknown M-Qudit Equatorial-Like State with Assistance

We propose a scheme to realize quantum cloning of an unknown M-qudit equatorial-like entangled state. The first stage of the protocol requires teleportation. After the teleportation is accomplished, the receiver can reestablish the original state. In the second stage of the protocol, with the assistance （through a single-particle projective measurement） of the preparer, the perfect copy of an original state can be produced at the site of the sender. Our scheme requires a single maximally entangled qudit pair as the quantum channel and three dits classical communication. The scheme is feasible at the expense of consuming local resources which include M - 1 ancillary qudits introduced by the receiver and additional bi-qudit operations. Moreover, we construct a sort of unitary transformations which ensure ancillary qudits are not necessarily introduced by the sender. Comparing to the previous protocols, the proposed protocol is economical due to that the cost of both quantum nonlocal resources and classical communication is lowest.