共查询到20条相似文献,搜索用时 16 毫秒
1.
2.
针对传统生物特征加密算法中所存在的不足.对模糊金库算法进行了一定的研究,基于指纹特征提出了一种改进的模糊金库算法.在密钥绑定阶段,根据生成的两两互素的正整数,将待保护密钥和生物特征相结合生成生物密钥.在密钥恢复阶段,根据(t,n)门限思想,运用中国剩余定理将获得的影子进行解密并恢复密钥.通过理论分析和仿真实验,密钥的安... 相似文献
3.
4.
5.
跳频信号每跳带宽窄且多跳间积累困难,利用传统方法对其时延估计精度都很低。针对该问题,该文充分挖掘跳频信号宽跳带的潜能,建立了多频点相时延估计模型,把时延估计问题转化为整周模糊求解问题;然后在解模糊过程中引入中国余数定理,针对非合作场景中模数无法选择的问题,提出一种基于虚拟频点的干涉相位外推方法,构造出鲁棒中国余数定理的适用条件;最后采用闭式鲁棒中国余数定理解算整周模糊,得到高精度的相时延。该方法具有精度高、运算量小、不依赖于信道衰落特性的优点。仿真结果验证了所提模型及方法的有效性和正确性。 相似文献
6.
针对基于中国剩余定理的门限RSA签名方案无法签署某些消息,以及部分签名合成阶段运算量大的问题,论文提出一种基于虚拟群成员的改进方法,使得改进后的方案能够签署所有消息,同时能够极大地减少部分签名合成阶段的运算量,当门限值为10时,可以将部分签名合成阶段的运算量减少为原来的1/6。对改进方案进行了详细的安全性和实用性分析。结果表明,改进方案在适应性选择消息攻击下是不可伪造的,且其运算效率较其他门限RSA签名方案更高。 相似文献
7.
为了避免交织器产生的时延,通过改进的渐进边增长(PEG)算法和循环中国剩余定理构造了一种不规则重复累积(IRA)码.与常规的IRA码相比,提出的码字具有半随机半结构化形式,不需要设计交织器,且码长选择更加灵活.仿真结果显示,在码率为1/2的条件下,当误码率为10-6时,构造的IRA(1 000,500)码与PEG-IRA(1 000,500)码和基于剩余类数对的IRA(1 000,500)码相比,在对应的相同条件下分别取得了0.2 dB和0.1 dB左右的净编码增益提升;且在码率为3/4时,所构造的IRA(16 200,11 880)码比相同码长和码率的DVB-S2标准LDPC码净编码增益提高了约0.1 dB左右. 相似文献
8.
9.
基于中国剩余定理解分布式星载SAR-ATI测速模糊 总被引:3,自引:0,他引:3
分布式星载SAR系统利用沿航迹干涉对地面运动目标测速时,由于较长基线导致严重的测速模糊。该文在研究鲁棒性中国剩余定理的基础上,利用剩余定理在满足某些约束条件下得到唯一解的原理,分析了多基线和多频率分布式星载SAR-ATI系统解速度模糊的方法,同时推导了多基线和多频率的约束条件,以及最大测速值。仿真结果表明该文算法能有效地解分布式星载SAR-ATI系统动目标速度模糊,为分布式星载SAR系统设计与基线设计提供了一定的指导作用和参考价值。 相似文献
10.
11.
12.
以FPGA芯片Cyclone II系列为核心,构建FPGA硬件平台,提出一种以资源优先为目的的DES、AES加解密设计方案。通过分析S盒的非线性特征,构造新的复合域变换,避免因同构变换产生的资源损耗。加解密过程中利用轮函数硬件结构的复用,达到硬件资源占用的最小化。整体采用内嵌流水线结构,减少逻辑复杂度的同时提高处理速度。实验结果验证了FPGA硬件加密的资源占用率远低于ASIC的硬件加密,执行速度达到Gbit/s,加密性能大大提高。 相似文献
13.
A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets 下载免费PDF全文
Yanjun Liu Lein Harn Chin‐Chen Chang 《International Journal of Communication Systems》2015,28(7):1282-1292
Verifiable secret sharing (VSS) has been extensively used as a cryptographic tool in many applications of information security in recent years. A VSS enables a dealer to divide a secret s into n shares and allows shareholders to verify whether their shares are generated by the dealer consistently without revealing the secrecy of both shares and the secret. More specifically, shareholders can verify that (i) the secret can be recovered by any t or more than t shares and (ii) the secret cannot be obtained by fewer than t shares. Many VSSs are based on polynomial, and only a few of them are based on the Chinese Remainder Theorem (CRT). Recently, Harn et al. proposed a CRT‐based VSS in which multiple verification secrets are used during the phase of verification. In this paper, we propose a VSS based on Asmuth‐Bloom's (t, n) SS scheme, which depends on the CRT. Our proposed VSS is simpler and more efficient than the scheme of Harn et al. Our proposed VSS is unconditionally secure. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
14.
15.
为增大QC-LDPC码围长的同时减少码中包含的短环,提高其纠错性能,提出了一种基于中国剩余定理( CRT)的QC-LDPC码改进联合构造方法。该方法将设计围长为g的长码长的QC-LD-PC码的问题简化为设计一个围长为g的短分量码的问题,然后通过对其余分量码校验矩阵的列块进行适当置换,使得构造出的QC-LDPC码具有更少的短环和更优的性能,更适于可靠性要求较高的通信系统。仿真结果表明,与已有的CRT联合构造方法设计的QC-LDPC码相比,新方法构造的QC-LDPC码具有更少的短环,在误码率为10-6时获得了1.2 dB的编码增益。 相似文献
16.
An authenticated group key distribution protocol based on the generalized Chinese remainder theorem 下载免费PDF全文
The group key distribution protocol is a mechanism for distributing a group key that is used to encrypt the communication data transmitted in an open group. Recently, a novel group key distribution protocol based on secret sharing was proposed. In their protocol, the group key information is broadcast in an open network environment, and only authorized group members can obtain the group key. However, their protocol requires each group member to broadcast a random challenge to the rest of the group members in the construction of the group key, and this may increase communication cost and cause network traffic congestion. In this paper, we propose an authenticated group key distribution protocol based on the generalized Chinese remainder theorem that drastically reduces communication costs while maintaining at least the same degree of security. Our protocol is built on the secret sharing scheme based on Chinese remainder theorem, which requires fewer computation operations than the previous work. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
17.
18.
A statistical approach to cryptanalysis of a memoryless function of clock-controlled shift registers is introduced. In the case of zero-order correlation immunity, an algorithm for a shift register initial state reconstruction based on the sequence comparison concept is proposed. A constrained Levenshtein distance relevant for the cryptanalysis is defined and a novel recursive procedure for its efficient computation is derived. Preliminary experimental results are given and open theoretic problems are discussed.Following [11], a Boolean function f(x
1,..., x
n) is said to be mth-order correlation immune if m is the maximum integer such that the random variable f(X
1,..., X
n) is statistically independent of every set of m random variables chosen from the balanced and independent binary random variables X
1,..., X
n. 相似文献
19.
20.
该文提出一种新的RS (Reed Solomon)码盲识别方法。该方法利用RS码等效二进制准循环码的代数结构,将截获到的二进制码序列映射为环上的线性码,应用中国剩余定理(Chinese Remainder Theorem, CRT)将环上的线性码进行直和分解,计算不同码长下所有本原多项式对应分量码在相应码空间的归一化维数,通过寻找归一化维数的最小值,实现对RS码码长和本原多项式的识别;最后通过对码字进行因式分解识别RS码的生成多项式。该方法具有使用数据量少,运算量低等方面的特点。仿真结果表明,能完成在较高误码率的情况下对RS码的快速盲识别。 相似文献