RAINBOW分组密码的线性密码分析

本文在对RAINBOW分组密码的基础模块深入研究和测试后,利用扩散层的特点,对RAINBOW分组密码进行了线性密码分析,攻击的数据复杂度为294,计算复杂度小于218.此结果显示RAINBOW分组密码对线性密码分析是不免疫的.     

有限自动机公钥密码体制的密码分析

提出一种针对有限自动机公钥密码系统的攻击算法,它可在多项式时间内破译有限自动机公钥密码方案FAPKCO.这一算法的基本思想,原则上也可用来攻击其他有限自动机公钥密码方案,因而在设计新的有限自动机公钥密码系统时,必须讨论它是否经得住这种方法的攻击.     

拟正则密码群并半群的一些等式(英文)

本文在拟正则密码群并半群范围内给出了局部纯正的拟正则密码群并半群及纯正的拟正则密码群并半群等的等式。     

电子门锁的密码问题

1问题的提出 某保密工作室，安装了电子门锁，这个电子门锁有n个密码特征数，不妨用0，1，2，…，n-1来表示；每个密码钥匙卡上都记着若干个密码特征数．当且仅当插入的k(k∈N^ ，k≤n～1)个密码钥匙卡能使n个数同时出现时，门锁才能被打开，此时，这个电子门锁的保密级数为k．     

密码战争

有了密码,就有了密码战争,从硝烟弥漫的战场到没有硝烟的战场．这场战争从没有停止过。接下来我们看看密码战争中曾经发生过什么吧。     

中国密码学家的重大成果

2004年与2005年是中国密码学界值得自豪的两年,一直在国际上广泛应用的两大密码算法MD5、SHA—1,宣布被中国密码专家破解,一时间国际密码学领域风起云涌.MD5与SHA—1算法是目前国际电子签名及许多其他密码应用领域的关键技术,广泛应用于金融、证券等电子商务领域.其中,SHA—1算法早在1994年便为美国政府采纳,目前广泛应用于美国政府的计算机密码系统.以往,专家们认为这两个算法固若金汤,哪怕调用全球的计算机,花费数百年、上千年的时间,也难以破解这两个算法.但这一切在2004年8月之后改变了:中国人攻克了这两座堡垒.破解这两大国际通…     

你敢玩密码吗

如果不考虑密码产生的历史背景，不考虑园重要密码被破译而带来的种种后果，单从密码的设计和解密来看，密码可是非常迷人的哦!     

通信密码简介(一)

<正>利用密码传送和储存信息是保证信息安全的一项最有效措施.在近代历史上,通信的保密措施,对军事和外交等方面有极端重要的意义,它直接关系到国家的安危和战争的胜负.例如,二战时期,美国密码专家用几个月时间完全破译了日本的密码"紫密".在中途岛一战,美国海军以劣     

由完全正则半群簇的几个子簇生成的格

应用密码群并半群的一个结构定理和同余方法, 决定了一个由完全正则半群簇的以下~6 个子簇~$\{\mathcal{NOBG, ROBG, OBG, NBA, RBA, BA}\}$ 生成的格.     

基于近似熵的随机数检验方法的设计与实现

把近似熵用于密码技术中,设计一种实用的随机数检验方法.该方法可以检测随机序列发生器产生序列的随机性,也可以用于检验密码算法的安全性.通过实验,发现该方法能更全面检验序列的随机特性.     

二维耦合Logistic映射的动力学性质及在流密码生成中的应用

本文研究了带二次耦合项的二维Logistic映射的性质和分岔行为,数值模拟了混沌的生成过程．若控制一个参数值近似为1,则产生近乎满的混沌区．这种混沌区产生的随机序列所生成的流密码具有很好的0-1分布、高线性复杂性、密钥敏感性等．最后给出了用于保密通信的模型．     

Design and statistical analysis of a new chaotic block cipher for Wireless Sensor Networks

Security issue is a vital and active topic in the research of Wireless Sensor Networks (WSN). After surveying the existing encryption algorithms for WSN briefly, we propose a new chaotic block cipher for WSN and then compare the performance of this cipher with those of RC5 and RC6 block ciphers. Simulation result demonstrates that better performance in WSN encryption algorithms can be achieved using the new cipher.     

具有特定非零Walsh谱值个数的布尔函数的研究及构造

布尔函数与其变元的相关性与流密码的相关攻击有紧密联系，Walsh变换则是研究布尔函数相关特性的主要工具，本文研究了非零Walsh谱值个数k=9，10的布尔函数，证明了k=9的函数的不存在性，并构造了所有k=10的函数。     

Using the Hill cipher to teach cryptographic principles

The Hill cipher is the simplest example of a block cipher, which takes a block of plaintext as input, and returns a block of ciphertext as output. Although it is insecure by modern standards, its simplicity means that it is well suited for the teaching of such concepts as encryption modes, and properties of cryptographic hash functions. Although these topics are central to modern cryptography, it is hard to find good simple examples of their use. The conceptual and computational simplicity of the Hill cipher means that students can experiment with these topics, see them in action, and obtain a better understanding that would be possible from a theoretical discussion alone. In this article, we define the Hill cipher and demonstrate its use with different modes of encryption, and also show how cryptographic hash functions can be both designed and broken. Finally, we look at some pedagogical considerations.     

A stream cipher based on a spatiotemporal chaotic system

A stream cipher based on a spatiotemporal chaotic system is proposed. A one-way coupled map lattice consisting of logistic maps is served as the spatiotemporal chaotic system. Multiple keystreams are generated from the coupled map lattice by using simple algebraic computations, and then are used to encrypt plaintext via bitwise XOR. These make the cipher rather simple and efficient. Numerical investigation shows that the cryptographic properties of the generated keystream are satisfactory. The cipher seems to have higher security, higher efficiency and lower computation expense than the stream cipher based on a spatiotemporal chaotic system proposed recently.     

量子Grover算法及其应用

深入剖析了G rover算法,最后将其应用于经典密码学,对序列密码和分组密码等进行了攻击和分析.     

A one-way coupled chaotic map lattice based self-synchronizing stream cipher

Self-synchronizing stream cipher (SSSC) has the advantage that the receiver can automatically synchronize with the sender after receiving previously transmitted ciphertext. However, it has also serious difficulty to keep security due to its self-synchronizing structure. In this paper, a new SSSC based on one-way coupled chaotic map lattice is proposed. By combining floating-point chaotic computations with algebraic operations, the cipher has high bit confusion and diffusion rates. It has both advantages of robustness of synchronization and strong security. The cipher can serve as a new type of SSSC candidate in software implementation.     

Distributing the Encryption and Decryption of a Block Cipher

In threshold cryptography, the goal is to distribute the computation of basic cryptographic primitives across a number of nodes in order to relax trust assumptions on individual nodes, as well as to introduce a level of fault-tolerance against node compromise. Most threshold cryptography has previously looked at the distribution of public key primitives, particularly threshold signatures and threshold decryption mechanisms. In this paper, we look at the application of threshold cryptography to symmetric primitives, and in particular the encryption or decryption of a symmetric key block cipher. We comment on some previous work in this area and then propose a model for shared encryption / decryption of a block cipher. We will present several approaches to enable such systems and will compare them.AMS classification: 94A60, 94A62, 68P25     

Cryptanalysis of the Stream Cipher LEX

Biryukov (The Design of a Stream Cipher LEX, Proceedings of Selected Areas in Cryptography, 2006 Springer, pp 67–75, 2007) presented a new methodology of stream cipher design called leak extraction. The stream cipher LEX, based on this methodology and on the AES block cipher, was selected to round 3 of the eSTREAM competition. The suggested methodology seemed promising, and LEX, due to its elegance, simplicity, and performance, was expected to be selected to the eSTREAM portfolio. In this article we present a key recovery attack on LEX. The attack requires about 2⁴⁰ bytes of key-stream produced by the same key (possibly under many different IVs), and retrieves the secret key in time of about 2¹⁰⁰ AES encryptions. Following a preliminary version of our attack, LEX was discarded from the final portfolio of eSTREAM.     

Attacks on the RC4 stream cipher

In this article we present some weaknesses in the RC4 cipher and their cryptographic applications. Especially we improve the attack described by Fluhrer, Mantin, Shamir (In: Selected Areas in Cryptography, 2001) in such a way, that it will work, if the weak keys described in that paper are avoided. A further attack will work even if the first 256 Byte of the output remain unused. Finally we show that variants of the RC4 algorithm like NGG and RC4A are also vulnerable by these techniques.