基于四维混沌猫映射分组密码的设计与分析

基于四维混沌猫映射提出一种新的128 bit混沌分组密码。128 bit数据重新排列成4×4的十进制矩阵,并对其进行8轮运算。在每一轮运算中,随机选取其中某一行和某一列执行四维猫映射变换,再采用子密钥对其变换结果进行加密。对密码算法进行密文随机性测试,明文与密文的相关性测试,明文的敏感性测试和密钥的敏感性测试。安全性分析表明,该分组密码具有抵抗差分攻击和线性攻击的优良性能,并且具有较大的密钥空间。     

Slippery hill-climbing technique for ciphertext-only cryptanalysis of periodic polyalphabetic substitution ciphers

Abstract

We present a stochastic method for breaking general periodic polyalphabetic substitution ciphers using only the ciphertext and without using any additional constraints that might come from the cipher’s structure. The method employs a hill-climbing algorithm for individual key alphabets, with occasional slipping down the hill. We implement the method with a computer and achieve reliable results for a sufficiently long ciphertext (150 characters per key alphabet). Because no constraints among the key alphabets are used, this method applies to any periodic polyalphabetic substitution cipher.     

Decoding Substitution Ciphers by Means of Word Matching with Application to OCR

A substitution cipher consists of a block of natural language text where each letter of the alphabet has been replaced by a distinct symbol. As a problem in cryptography, the substitution cipher is of limited interest, but it has an important application in optical character recognition. Recent advances render it quite feasible to scan documents with a fairly complex layout and to classify (cluster) the printed characters into distinct groups according to their shape. However, given the immense variety of type styles and forms in current use, it is not possible to assign alphabetical identities to characters of arbitrary size and typeface. This gap can be bridged by solving the equivalent of a substitution cipher problem, thereby opening up the possibility of automatic translation of a scanned document into a standard character code, such as ASCII. Earlier methods relying on letter n-gram frequencies require a substantial amount of ciphertext for accurate n-gram estimates. A dictionary-based approach solves the problem using relatively small ciphertext samples and a dictionary of fewer than 500 words. Our heuristic backtrack algorithm typically visits only a few hundred among the 26! possible nodes on sample texts ranging from 100 to 600 words.     

基于新复合混沌动力系统的加密算法

提出两个新型混沌映射,并基于Devaney定义给出了严格混沌的理论特性证明。利用复合离散混沌系统的特性,提出基于两个新型混沌映射设计的复合离散混沌系统的序列密码算法,该映射产生的具有均匀分布函数量化后可生成具有平衡性质的0-1序列。 复合离散混沌系统均匀的不变分布还使密文具有很好的随机特性,由于迭代对初始条件的敏感性和迭代函数选择的随机性,密钥、明文与密文之间形成了复杂而敏感的非线性关系,而且密文和明文的相关度也很小,可以有效地防止密文对密钥和明文信息的泄露。分析表明,该系统具有很高的安全性并扩大了密钥空间。     

基于随机性特征的SM4分组密码体制识别

对加密算法的识别是进行密码分析的首要工作.目前的识别方案涵盖了分组密码的识别、流密码的识别以及对称密码和公钥密码混合算法的识别.随着国密算法的应用普及,其安全性也备受关注.针对国密算法提出了基于随机性特征的SM4分组密码体制识别,将国密SM4算法与国际主要标准分组密码算法进行识别.利用随机性测试方法对密文进行特征提取,从而得到特征向量,由这些特征向量构成特征空间,最后借助机器学习算法对特征空间进行训练和测试.实验结果表明,SM4与其他分组密码算法的识别率高达90％以上.后续工作可以对分类算法和特征选取两个方向进行突破,来验证密码识别方案的有效性和可行性.     

可计算密文加密体制研究

可计算密文加密体制是指对密文可以进行的一系列指定函数运算的加密体制,与传统加密体制最大的不同是加密后的密文不再是“混乱”的,而是具有某些隐含关系,其可成为某些特定函数的有效输入并且经过函数计算后可成为用户的有效信息。由于可直接对密文进行操作,可计算密文加密体制在保证信息机密性的前提下大大提高了信息的可用性效率,已经成为现代公钥密码学研究的热点方向。文章对谓词加密、全同态加密、函数加密3类可计算密文加密技术做了具体概述,介绍了各类可计算密文加密体制的关系,分析了可计算密文加密体制的计算隐私与应用要求,为以后研究可计算密文加密技术提供了指导。     

基于菲涅耳变换的图像加密算法

针对相位截断加密算法无法抵御信息泄露问题,文章提出了一种基于相位截断菲涅耳变换与随机振幅掩模的加密算法,以抵御信息泄露问题;算法首先将原彩色图像分为3个独立的颜色通道,在对其进行菲涅耳变换后加入随机振幅掩模通道,将4个通道分别进行菲涅耳衍射截断处理;算法通过级联处理不仅提高了秘钥与密文间的关联性,还消除了信息泄露的风险;通过仿真试验与结果分析可知,本算法不仅在波长与自由空间传播错误距离参数、密文噪声、遮挡污染、密文泄露以及不同攻击等情况下有较好的鲁棒性,还解决了信息泄露问题。     

基于ElGamal的同态云端密文存储检索方案

云端数据存储的安全性和检索效率是网络空间安全亟待解决的问题之一.本文提出了一个新的密文检索模型,并在此基础上利用ElGamal同态密码算法和SM4分组密码算法,设计了一种基于混合同态加密的云端密文存储检索方案.首先,该检索方案能够在数据上传、检索和下载的过程中,保证数据的安全,可用于个人云端U盘等应用场景.其次,对该方案的正确性和安全性进行分析.最后,通过实验的方式对方案的正确性进行了证明.实验结果表明该方案在保证数据安全的情况下,检索结果正确,效率高.     

基于ZUC与DWT-SVD的交换加密水印算法

为了有效解决多媒体数据在传输、存储过程中的安全及版权保护问题,提出基于祖冲之序列密码算法(zuc)与离散小波变换—奇异值分解(DWT-SVD)的交换加密水印算法.该算法基于奇异值不变性,将水印嵌入到奇异值中,通过ZUC算法分别对奇异值矩阵集合、奇异矩阵集合置换加密.水印嵌入操作与加密操作的先后顺序不影响含水印密文的生成,且从含水印密文和解密后的明文中都能提取完整的水印.实验表明,水印的不可见性较好,算法有较高的安全性并具有—定的鲁棒性.     

MA4210 ALPHANUMERIC POCKET CIPHER

Abstract

Vigenère ciphers can be broken, if the key length is known. In trying to break the Vigenère cipher, Charles Babbage and Friedrich Wilhelm Kasiski found the length of the key by searching for periodical repetitions in the ciphertext to split the cipher into multiple Caesar ciphers. William Friedman's, “index of coincidence,” also requires an adequate length of the ciphertext to retrieve the key length. Both methods lack, if the ciphertext is short or does not include repetitions and no other effective linguistic solution to break short Vigenère ciphers is known. Massively decreasing the solution space by logic, reverse digram frequency, and language properties allows breaking short and long Vigenère ciphers with and without repetitions.     

Remarks on breaking the Vigenère autokey cipher

Abstract

It has been mentioned by Shannon that a Vigenère autokey ciphertext can be transformed into a Vigenère ciphertext, provided the length of the priming key is known. We revisit this transformation and argue that combining it with the Friedman test, in fact, allows revealing of the length of the priming key. Thus, Shannon’s transformation together with the Friedman test allow transforming a Vigenère autokey ciphertext into a Vigenère ciphertext without any prior information. This allows an adversary to solve a Vigenère autokey ciphertext as if it was a Vigenère ciphertext. In addition, we show that the same method can be used to solve a modification of the Vigenère autokey cipher used in the Russian Civil War in 1917–1922.     

基于DWT密文域图像双水印算法

数字水印是保护数字版权的关键技术,本文首先给出双水印算法形式化的定义,然后基于小波变换(DWT)、SM4分组密码算法和Paillier同态密码,设计了一个密文域双水印算法.在嵌入水印时,将载体图像进行三重DWT变换,将频带集分为加密部分、水平高频LH3水印部分和垂直高频HL3水印部分.利用SM4分组密码和Paillier公钥密码分别对加密部分和水印部分频带系数加密,同时利用Paillier公钥密码体制对数字水印信息进行加密,利用最低有效位(LSB)方法,分别在LH3和HL3的密文域嵌入两个用户水印信息.最后DWT小波逆变换后生成含水印的密文图像.在水印提取时,由于Paillier具有同态特性,实现了在解密后的明文提取水印.实验结果表明,该算法具有加解密速度快,水印的不可见性好等特性.     

FaceEncAuth：基于FaceNet和国密算法的人脸识别隐私安全方案

人脸识别中,人脸特征作为生物特征的一种,具有唯一性、不可撤销性,一旦遭到攻击、篡改或泄露,用户隐私安全将面临巨大威胁。针对这一问题,提出一种基于深度学习和加密算法的人脸识别隐私安全方案。该方案中,利用FaceNet深度学习算法来高效提取人脸特征,协调生物特征模糊性与密码系统的精确性,采用CKKS全同态加密算法进行人脸识别密文域的运算,通过国密SM4算法增强人脸特征密文抵抗恶意攻击的能力,利用其对称密码的性质兼顾了安全性和运算效率,而SM9非对称密码算法则用于SM4算法对称密钥的管理。实验结果及分析表明,该方案在不影响人脸识别准确率、效率的前提下提高了数据传输、存储和比对的安全性。     

Rijndael分组密码的伪随机数发生器

提出了一种基于Rijndael分组密码的伪随机数发生器,称为Rijndael PRNG。安全性分析、伪随机特性测试以及相空间重构分析表明,Rijndael PRNG具有方法简单、安全性高、伪随机性能良好、硬件实现容易等特点,为实际应用提供了一种新的伪随机数发生器方案。     

新的基于双混沌系统和压缩感知的图像加密算法

Image encryption technology plays an important role in today’s multimedia applications and Internet information security transmission. However, most image encryption algorithms still have problems, for example, cipher images occupied high bandwidth during transmission, image encryption speed is slow, image encryption algorithms are not associated with plain image, and there is no complete ciphertext feedback mechanism. These prob-lems all affect the security and easy use of image encryption algorithms. In order to solve the above problems, the compressive sensing technology and chaotic system were studied, and a new image encryption algorithm based on double chaotic system and compressive sensing with plaintext association was proposed. The plaintext image association key was used to associate the plain image hash value with the Logistic chaotic system parameters. Discrete wavelet transform, was used to sparse the plain image. Then the random measurement matrix was generated by the Logistic chaos system, and the image was encrypted once by combining the compressive sensing technique and the random measurement matrix to obtain the intermediate image. The intermediate image was hashed again, and the Rucklidge chaos system initial value was associated with the plain image hash value together. The Rucklidge chaotic system and encryption algorithm were used to control the intermediate image for secondary encryption and accord-ingly obtain the cipher image. The encryption algorithm was a new plaintext correlation encryption algorithm, which used the image’s own pixel value to control the scrambling of the intermediate image. It also enhanced the plaintext association and established a ciphertext feedback mechanism. Simulation results and performance analysis show that the algorithm has good encryption performance. The encrypted image can be compressed according to the compres-sion ratio, effectively reducing the size of the cipher image. Moreover, it is resistant to common attacks such as known plaintext attack, selective plaintext attack and differential attack, which is better than other common image encryption algorithms. © 2022, Beijing Xintong Media Co., Ltd.. All rights reserved.     

一种基于分段线性映射的分组密码算法

提出了一种新的基于混沌理论的分组密码算法,把128比特的明文加密为128比特的密文.整个加密过程包含了8个轮变换,每一个轮变换由替换变换、移位变换和置换变换3部分组成.所有的轮密钥都由128位的比特流K和由分段线性映射产生的128比特随机二进制序列导出.理论与实验分析表明该算法克服了一些纯混沌密码系统的固有缺陷,具有较高的性能.     

一个基于混沌系统的动态换位加密方案

在对换位加密技术研究的基础上,提出了一个基于混沌系统的动态换位加密方案。该方案通过二进制数据转换、数据替换及动态换位等加密步骤,很好地实现了明文的混淆与扩散。与传统的换位加密相比,新方案不仅有较大的密钥空间,而且产生的换位序列具有很强的随机性。理论分析及实验结果表明,给出的新方案可以抵抗多种已知的密码攻击,克服了传统换位加密技术的弱点,具有较高的安全性。     

指定使用者的多服务器多关键字可搜索加密方案

针对现有可搜索加密方案中密文检索效率低、搜索结果不精确以及不支持数据使用者身份验证等问题,在无证书密码体制下,提出一种指定使用者且多服务器多关键字的可搜索加密方案。使用多服务器和多关键字技术在降低服务器负荷的同时提高用户检索密文的速度,使搜索结果更加精确。在搜索验证阶段,搜索服务器验证数据使用者的身份,若身份合法则存储服务器根据关键字向数据使用者返回相应密文。性能分析结果表明,在随机预言机模型下该方案可以抵抗内外关键字猜测攻击,且能够在降低计算开销的同时提高搜索效率,在安全性和效率方面均具备一定优势。     

A note on quantum related-key attacks

In a basic related-key attack against a block cipher, the adversary has access to encryptions under keys that differ from the target key by bit-flips. In this short note we show that for a quantum adversary such attacks are quite powerful: if the secret key is (i) uniquely determined by a small number of plaintext–ciphertext pairs, (ii) the block cipher can be evaluated efficiently, and (iii) a superposition of related keys can be queried, then the key can be extracted efficiently.     

一种改进的R-LWE同态掩码方案

针对格上加密方案的差分能量攻击,Reparaz等人在PQC 2016上提出一种具有加法同态的R-LWE掩码方案。该方案能够有效的抵抗差分能量攻击,但由于密文的同态加法造成密文中噪声尺寸增大,降低解密正确率。针对这一问题,提出一个改进的R-LWE同态掩码方案。引入模转换技术,对同态加密之后的密文进行模规约,在保证明密文对应的前提下,降低密文中的噪声尺寸,提高方案的解密正确率。为了保护子密钥,引入随机矩阵对子密钥进行掩码保护,并给出正确性分析及安全性证明。分析表明,相对于原方案,新方案从安全性和效率上都有较大的提升。