检索结果-南通市图书馆

cryptanalysis of 2D-SCMCI Hyperchaotic Map Based Image Encryption Algorithm

Computer Systems Science & Engineering 2023年第8期46卷 2401-2414页

作者： Mohammed S.Alshehri Sultan Almakdi Mimonah Al Qathrady Jawad Ahmad Department of Computer Science Najran UniversityNajran55461Saudi Arabia Department of Information Systems Najran UniversityNajran55461Saudi Arabia School of Computing Edinburgh Napier UniversityEdinburghEH105DTUK

Chaos-based cryptosystems are considered a secure mode of communication due to their reliability.Chaotic maps are associated with the other domains to construct robust encryption algorithms.There exist numerous encryption schemes in the literature based on chaotic maps.This work aims to propose an attack on a recently proposed hyper-chaotic map-based cryptosystem.The core notion of the original algorithm was based on permutation and diffusion.A bitlevel permutation approach was used to do the permutation row-and column-wise.The diffusion was executed in the forward and backward directions.The statistical strength of the cryptosystem has been demonstrated by extensive testing conducted by the author of the cryptosystem.This cryptanalysis article investigates the robustness of this cryptosystem against a chosen-plaintext attack.The secret keys of the cryptosystem were retrieved by the proposed attack with 258 chosen-plain images.The results in this manuscript suggest that,in addition to standard statistical evaluations,thorough cryptanalysis of each newly suggested cryptosystem is necessary before it can be used in practical application.Moreover,the data retrieved is also passed through some statistical analysis to compare the quality of the original and retrieved data.The results of the performance analysis indicate the exact recovery of the original data.To make the cryptosystem useful for applications requiring secure data exchange,a few further improvement recommendations are also suggested.

关键词： cryptanalysis hyperchaotic map image encryption chosen-plaintext attack cryptosystem

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

cryptanalysis of an asymmetric cipher protocol using a matrix decomposition problem

引用

Science China(Information Sciences) 2016年第5期59卷 133-143页

作者： Jinhui LIU Huanguo ZHANG Jianwei JIA Houzhen WANG Shaowu MAO Wanqing WU Computer School of Wuhan University Key Laboratory of Aerospace Information security and trusted computing Ministry of Education

Advances in quantum computation threaten to break public key cryptosystems such as RSA, ECC,and El Gamal that are based on the difficulty of factorization or taking a discrete logarithm, although up to now,no quantum algorithms have been found to be able to solve certain mathematical problems on non-commutative algebraic structures. Against this background, Raulynaitis et al. have proposed a novel asymmetric cipher protocol using a matrix decomposition problem. Their proposed scheme is vulnerable to a linear algebra attack based on the probable occurrence of weak keys in the generation process. In this paper, we show that the asymmetric cipher of the non-commutative cryptography scheme is vulnerable to a linear algebra attack and that it only requires polynomial time to obtain the equivalent keys for some given public keys. We also propose an improvement to enhance the scheme of Raulynaitis et al.

关键词： cryptography post-quantum computational cryptography asymmetric cipher protocol cryptanalysis matrix decomposition

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

cryptanalysis and improvement of quantum broadcast communication and authentication protocol with a quantum one-time pad

引用

Chinese Physics B 2016年第8期25卷 59-64页

作者：刘志昊陈汉武 School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Center for Quantum Computation and Intelligent Systems Faculty of Engineering and Information TechnologyUniversity of Technology Sydney

The security of quantum broadcast communication（QBC） and authentication protocol based on Greenberger–Horne–Zeilinger（GHZ） state and quantum one-time pad is analyzed. It is shown that there are some security issues in this protocol.Firstly, an external eavesdropper can take the intercept–measure–resend attack strategy to eavesdrop on 0.369 bit of every bit of the identity string of each receiver without being detected. Meanwhile, 0.524 bit of every bit of the secret message can be eavesdropped on without being detected. Secondly, an inner receiver can take the intercept–measure–resend attack strategy to eavesdrop on half of the identity string of the other＇s definitely without being checked. In addition, an alternative attack called the CNOT-operation attack is discussed. As for the multi-party QBC protocol, the attack efficiency increases with the increase of the number of users. Finally, the QBC protocol is improved to a secure one.

关键词： cryptanalysis quantum broadcast communication information leakage intercept-measure-resendattack CNOT-operation attack

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

cryptanalysis of a Type of CRT-Based RSA Algorithms

引用

Journal of Computer Science & Technology 2008年第2期23卷 214-221页

作者：秦宝东李明孔凡玉 College of Computer Science and Technology Southwest University of Science and TechnologyMianyang 621010China Institute of Network Security Shandong UniversityJinan 250100China Key Laboratory of Cryptographic Technology and Information SecurityJinan 250100China

It is well known that the Chinese Remainder Theorem （CRT） can greatly improve the performances of RSA cryptosystem in both running times and memory requirements. However, if the implementation of CRT-based RSA is careless, an attacker can reveal some secret information by exploiting hardware fault cryptanalysis. In this paper, we present some fault attacks on a type of CRT-RSA algorithms namely BOS type schemes including the original BOS scheme proposed by Blomer, Otto, and Seifert at CCS 2003 and its modified scheme proposed by Liu et al. at DASC 2006. We first demonstrate that if some special signed messages such as m = 0, ±1 are dealt carelessly, they can be exploited by an adversary to completely break the security of both the BOS scheme and Liu et al.＇s scheme. Then we present a new permanent fault attack on the BOS scheme with a success probability about 25%. Lastly, we propose a polynomial time attack on Liu et al.＇s CRT-RSA algorithm, which combines physical fault injection and lattice reduction techniques when the public exponent is short.

关键词： Chinese remainder theorem RSA BOS scheme cryptanalysis fault attack LLL

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

cryptanalysis of Achterbahn-Version 1 and-Version 2

引用

Journal of Computer Science & Technology 2007年第3期22卷 469-475页

作者：黄小莉武传坤 The State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences

Achterbahn is one of the candidate stream ciphers submitted to the eSTREAM, which is the ECRYPT Stream Cipher Project. The cipher Achterbahn uses a new structure which is based on several nonlinear feedback shift registers （NLFSR） and a nonlinear combining output Boolean function. This paper proposes distinguishing attacks on Achterbahn-Version 1 and -Version 2 on the reduced mode and the full mode. These distinguishing attacks are based on linear approximations of the output functions. On the basis of these linear approximations and the periods of the registers, parity checks with noticeable biases are found. Then distinguishing attacks can be achieved through these biased parity checks. As to Achterbahn-Version 1, three cases that the output function has three possibilities are analyzed. Achterbahn-Version 2, the modification version of Achterbahn-Version 1, is designed to avert attacks based on approximations of the output Boolean function. Our attack with even much lower complexities on Achterbahn-Version 2 shows that Achterbahn-Version 2 cannot prevent attacks based on linear approximations.

关键词： cryptology cryptanalysis distinguishing attack stream cipher Achterbahn eSTREAM

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

cryptanalysis of an MOR cryptosystem based on a finite associative algebra

引用

Science China(Information Sciences) 2016年第3期59卷 137-145页

作者： Wanqing WU Huanguo ZHANG Houzhen WANG Shaowu MAO Shuomei WU Haiqing HAN Computer School of Wuhan University Computer Department Shijiazhuang University School of Mathematics and Physics Hubei Polytechnic University

The Shor algorithm is effective for public-key cryptosystems based on an abelian group. At CRYPTO 2001, Paeng（2001） presented a MOR cryptosystem using a non-abelian group, which can be considered as a candidate scheme for post-quantum attack. This paper analyses the security of a MOR cryptosystem based on a finite associative algebra using a quantum algorithm. Specifically, let L be a finite associative algebra over a finite field F. Consider a homomorphism φ : Aut（L） → Aut（H） × Aut（I）, where I is an ideal of L and H ■ L/I.We compute dim Im（φ） and dim Ker（φ）, and combine them by dim Aut（L） = dim Im（φ） + dim Ker（φ）. We prove that Im（φ） = Stab Comp（H,I）(μ + B;（H, I）) and Ker（φ）■ Z;（H, I）. Thus, we can obtain dim Im（φ）, since the algorithm for the stabilizer is a standard algorithm among abelian hidden subgroup algorithms. In addition,Z;（H, I） is equivalent to the solution space of the linear equation group over the Galois fields GF（p）, and it is possible to obtain dim Ker（φ） by the enumeration theorem. Furthermore, we can obtain the dimension of the automorphism group Aut（L）. When the map ? ∈ Aut（L）, it is possible to effectively compute the cyclic group ? and recover the private key a. Therefore, the MOR scheme is insecure when based on a finite associative algebra in quantum computation.

关键词： MOR cryptosystem cryptanalysis quantum algorithm finite associative algebra hidden subgroup problem stabilizer

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

cryptanalysis and improvement of a digital image encryption method with chaotic map lattices

引用

Chinese Physics B 2013年第5期22卷 198-202页

作者：王兴元刘林涛 Faculty of Electronic Information and Electrical Engineering Dalian University of Technology

A digital image encryption scheme using chaotic map lattices has been proposed recently. In this paper, two fatal flaws of the cryptosystem are pointed out. According to these two drawbacks, cryptanalysts could recover the plaintext by applying the chosen plaintext attack. Therefore, the proposed cryptosystem is not secure enough to be used in the image transmission system. Experimental results show the feasibility of the attack. As a result, we make some improvements to the encryption scheme, which can completely resist our chosen plaintext attack.

关键词： cryptanalysis chosen plaintext attack image encryption chaotic map lattice

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

cryptanalysis of an ergodic chaotic encryption algorithm

引用

Chinese Physics B 2012年第4期21卷 159-165页

作者：王兴元谢旖欣秦学 Faculty of Electronic Information and Electrical Engineering Dalian University of TechnologyDalian 116024China

In this paper, we present the results for the security and the possible attacks on a new symmetric key encryption algorithm based on the ergodicity property of a logistic map. After analysis, we use mathematical induction to prove that the algorithm can be attacked by a chosen plaintext attack successfully and give an example to show how to attack it. According to the cryptanalysis of the originM Mgorithm, we improve the originM Mgorithm, and make a brief cryptanalysis. Compared with the original algorithm, the improved algorithm is able to resist a chosen plaintext attack and retain a considerable number of advantages of the original algorithm such as eneryption speed, sensitive dependence on the key, strong anti-attack capability, and so on.

关键词： chaos cryptanalysis encryption block-cipher

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

cryptanalysis of Prime Power RSA with two private exponents

引用

Science China(Information Sciences) 2015年第11期58卷 59-66页

作者： ZHENG MengCe HU HongGang Key Laboratory of Electromagnetic Space Information Chinese Academy of Sciences School of Information Science and Technology University of Science and Technology of China

In this paper, we consider a variant of RSA schemes called Prime Power RSA with modulus N= prq for r 2, where p, q are of the same bit-size. May showed that when private exponent d 详细信息

In this paper, we consider a variant of RSA schemes called Prime Power RSA with modulus N= prq for r 2, where p, q are of the same bit-size. May showed that when private exponent d

关键词： cryptanalysis Prime Power RSA two private exponents LLL algorithm Coppersmith’s techniques

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

cryptanalysis of full PRIDE block cipher

引用

Science China(Information Sciences) 2017年第5期60卷 169-180页

作者： Yibin DAI Shaozhen CHEN State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute

PRIDE is a lightweight block cipher proposed at CRYPTO 2014 by Albrecht et al., who claimed that the construction of linear layers is efficient and secure. In this paper, we investigate the key schedule and find eight 2-round iterative related-key differential characteristics, which can be used to construct 18-round related-key differentials. A study of the first subkey derivation function reveals that there exist three weak-key classes, as a result of which all the differences of subkeys for each round are identical. For the weak-key classes,we also find eight 2-round iterative related-key differential characteristics. Based on one of the related-key differentials, we launch an attack on the full PRIDE block cipher. The data and time complexity are 2;chosen plaintexts and 2;encryptions, respectively. Moreover, by using multiple related-key differentials, we improve the cryptanalysis, which then requires 2;chosen plaintexts and 2;encryptions, respectively. Finally, we use two 17-round related-key differentials to analyze full PRIDE, which requires 2;plaintexts and 2;encryptions.These are the first results on full PRIDE, and show that the PRIDE block cipher is not secure against related-key differential attack.

关键词： cryptanalysis block cipher PRIDE iterative characteristics related-key differential

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：