共查询到20条相似文献,搜索用时 15 毫秒
1.
《Electronics letters》1991,27(13):1121-1122
Tsujii et al. (see ibid., vol.23, no.11, p.558-60, 1987) proposed a public key cryptosystem which requires only O(m/sup 2/) bit operations for encryption/decryption and which also realised digital signatures; m here is the block length. The speed advantage over better known systems such as the RSA system (which takes O(m/sup 3/) operations) could have been immensely significant. Unfortunately it is possible to deduce the private key of the Tsujii system from the public key in polynomial time except possibly in a tiny minority of randomly chosen cases.<> 相似文献
2.
3.
A public key cryptosystem is proposed, which is based on the assumption that finding the square root of an element in a large finite ring is computationally infeasible in the absence of a knowledge of the ring structure. The encryption and decryption operations are very fast, and the data expansion is 1:2. 相似文献
4.
5.
针对信号传输通道相位估计等问题,提出了一种通过利用Chebyshev正交多项式逼近函数计算反正切函数值求取通道相位的算法,该算法通过象限判别、区间划分的方法计算反正切函数的输入值,然后利用Chebyshev正交多项式逼近函数计算信号相位,最后,通过迭代算法简化计算。该算法具有算法简单,估计速度快、精度高的特点。 相似文献
6.
7.
8.
有限域和剩余类环上非奇异反馈多项式的谱刻划 总被引:3,自引:1,他引:2
本文给出了有限域和剩余类环上非线性反馈移存器的非奇异反馈多项式及局部置换多项式的谱刻划,简化了素域上的现有结果,并对有限域上和剩余类环上相关免疫函数的谱特征给出了一个新的证明方法。 相似文献
9.
We develop new fast algorithms for 2-D integer circular convolutions and 2-D number theoretic transforms (NTT). These new algorithms, which offer improved computational complexity, are constructed based on polynomial transforms over Zp; these transforms are Fourier-like transforms over Zp, which is the integral domain of polynomial forms over Zp[x]. Having defined such polynomial transforms over Zp we prove several necessary and sufficient conditions for their existence. We then apply the existence conditions to recognize two applicable polynomial transforms over Zp. One is for p equal to Mersenne numbers and the other for Fermat numbers. Based on these two transforms, referred to as Mersenne number polynomial transforms (MNPT) and Fermat number polynomial transforms (FNPT), we develop fast algorithms for 2-D integer circular convolutions, 2-D Mersenne number transforms, and 2-D Fermat number transforms. As compared to the conventional row-column computation of 2-D NTT for 2-D integer circular convolutions and 2-D NTT, the new algorithms give rise to reduced computational complexities by saving more than 25 or 42% in numbers of operations for multiplying 2 i, i⩾1; these percentages of savings also grow with the size of the 2-D integer circular convolutions or the 2-D NTT 相似文献
10.
11.
通过对不同结构的广义切比雪夫型LC滤波器的传输零点特性进行分析验证,得到适用于N阶广义切比雪夫型LC滤波器传输零点特性的结论。基于这些结论提出一种快速设计广义切比雪夫型LC滤波器的方法,大大缩短了设计滤波器的时间。并且该方法可以在实现滤波器带外截止特性的同时,实现滤波器小型化,在科学研究和工程应用中具有重要意义。 相似文献
12.
13.
14.
15.
广义Chebyshev滤波器的优化设计及其快速调试技术研究 总被引:1,自引:0,他引:1
文章给出了带传输零点的广义切比雪夫滤波器的分析方法,介绍了优化算法,并讨论了其在滤波器综合设计中的应用,得到耦合矩阵的实际形式。然后对实际微波滤波器的调试技术进行了研究,提出一套人工快速调试方法。最后利用仿真软件建立一个八阶同轴腔滤波器模型并加工调试,实际测试与理论结果吻合较好。 相似文献
16.
17.
18.
基于LMS及RLS的自适应均衡算法仿真分析 总被引:2,自引:0,他引:2
在通信系统中采用均衡技术是改善信道特性行之有效的方法,为此从时域均衡原理出发,讨论了基于LMS和基于RLS的自适应均衡算法,并利用Matlab对两类算法进行了仿真,从均衡前后信号的星座图、算法收敛特性以及均衡前后系统的误码特性这三个方面对两类算法的性能进行了比较. 相似文献
19.
针对当前系统设计中软硬件设计者分别采用不同的设计语言存在的问题,采用基于Python的软硬件协同设计方法,以信号处理和图像处理中常用的平方根算法为例,在FPGA上实现了定点平方根算法。实验结果表明Python可以有效地将软件算法快速地转换为硬件设计,并能大幅度提高系统设计,仿真和校验的效率,使得这种方法设计的产品能更快地进入市场。 相似文献