Proxy-cryptocurrency payment system

The decentralized cryptocurrency which was based on block chain has been thought the most successful one in history.In the system,public keys were used as the users’ accounts which guaranteed the anonymity in real transactions.However,all the transaction information was recorded in the block chain,it was a potential threat for users’ privacy which might leak the payment information.Moreover,to avoid double-spending,it was agreed that the transaction on the target block was valid only if another k blocks were generated after the target one.The long waiting time reduced the efficiency of the payment system.A model of payment system based on a proxy-cryptocurrency was proposed,and a solution based on blind signature techniques was proposed.The scheme introduced a proxy in the payment phase,by which transaction confirmation time could be reduced and the transaction efficiency could be improved.Meanwhile,the system implements better anonymity,namely as the privacy protection function.     

PKI／CA技术在国防军工PDM系统中的安全应用

随着信息化不断发展,PDM系统已经成为国防军工企业战略发展的重要组成部分。在PDM系统建设逐步成熟的背景下,PDM的安全性（身份鉴别与数据安全）也成为摆在国防军工企业面前的一大难题。为解决PDM系统安全性问题,这里以国际通用先进的信息安全技术为参考,以国内信息安全标准为依据,结合PDM系统业务应用的现状,提出了采用PKI公钥基础设施为PDM系统提供安全支撑的技术思路。从而利用PKI完善灵活的接口和标准的安全中间件,使得PDM和新建应用系统可以方便地纳入基于PKI的安全信息服务体系。     

信息安全在邮政金融网中的实现

随着邮政金融网络化进程的推进,邮政金融系统的安全风险也越来越高,因此如何实现网络信息安全成为保证邮政金融系统正常运行至关重要的因素.文中介绍了实现网络信息安全的有关技术及实现方法,如数据加密、数字签名、防火墙等.通过应用这些安全防范技术,提出相应的网络信息安全方案,使邮政金融信息能够安全地在网络中进行通信.合理的网络安全方案和完善的管理体制是邮政金融网络系统安全运行的必要条件.     

Cryptanalysis of an extended MQ signature system HTTM

Since Multivatriate Quadratic （MQ）-based Public Key Cryptosystem （MPKC） has been one of the hot research fields of post-quantum cryptography, it becomes important to analyze the security of new MPKC schemes. Wang et al. proposed a novel multivariate signature scheme with Hash-based Tame Transformation and Minus （HTTM） in 2011. For this extended MQ-based signature, we can transform it into an SFLASH variant by splitting and merging HT transformation, and solve an equivalent private key corresponding to the public key of HTTM. Thus, the adversary can forge legitimate signature for any message by using this equivalent private key.     

一种新型门限代理签名方案

文章针对代理签名没有解决的代理撤销问题,基于门限思想,提出一种新的门限代理签名方案。该方案不需要可信中心的支持,仅在参与签名成员的合作下,就可以完成对代理签名人的资格审查,可快速撤销签名人的代理权利,并帮助代理签名人生成合法的签名。     

Cyclic code weight spectra and BIST aliasing

In built-in self-test for logic circuits, test data reduction can be achieved using a linear feedback shift register. The probability that this data reduction will allow a faulty circuit to be declared good is the probability of aliasing. Based on the independent bit-error model, we show that the code spectra for the cyclic code generated by the feedback polynomial can be used to obtain an exact expression for the aliasing probability of a multiple input signature register when the test length is a multiple of the cycle length. Several cases are examined and, as expected, primitive feedback polynomials provide the best performance. Some suggestions to avoid peaks in the aliasing probability are given.     

辫群上新的签名体制

 辫群是构造抗量子攻击密码协议的新平台。该文基于辫群上求根问题的难解性提出了新的签名体制,并证明其在随机预言模型下能抵抗适应性选择消息的存在性伪造攻击。新体制在签名验证阶段不需要判断辫元是否存在共轭关系,计算效率比共轭签名体制、改进共轭签名体制更高;签名由一个整数和一个辫元组成,与共轭签名体制相比长度更短,与改进共轭签名体制长度相当。     

海面正置长方体目标复合散射极化特征

为分析海面上长方体目标的极化特征,通过极化特征图讨论了长方体目标尺寸参数和海面风速、风向对于复合极化散射的影响.计算结果显示入射角和目标尺寸足够大的情况下,二次散射更为突出,对应的极化特征图具有明显的二面角特点.侧风将会改变极化特征图的对称性.     

IKE协议防止中间人攻击性能分析及改进

在基于数字签名认证主模式IKE协议最新研究进展的基础上,针对其安全漏洞,提出了一种改进方案。该方案在遵循ISAKMP框架及IKE交互对称结构的基础上,采用分步认证的方法,能够及早发现并阻止中间人攻击,从而保护通信双方的身份。性能分析表明,该方案是安全、高效、可行的。     

Aliasing probability transients

Test data reduction for digital systems is often accomplished through the use of a feedback shift register. This method, known as signature analysis, can exhibit error masking or aliasing. Recent analysis has shown that the use of a primitive polynomial for the register feedback can reduce the probability of aliasing. In this work we demonstrate that not all primitive polynomials are created equal. Some primitive polynomials can have very large transients in their aliasing probability. For example, 1 +X ¹³ +X ³³ can exhibit an aliasing probability more than a million times larger than its asymptotic value of 2^–33. An evaluation procedure is presented which can identify polynomials with good transient characteristics. Some recommended feedback polynomials are given.