期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到99篇文章
< 1 2 … 5 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Cryptanalysis and Improvement of the Multi-User QPCE Protocol with Semi-Honest Third Party 认领 引用 被引量：2
1
作者 昌燕 许春香 +5 位作者 张仕斌 王海春 闫丽丽 韩贵华 黄源源 盛志伟 《Chinese Physics Letters》 SCIE EI CAS CSCD 2016年第1期1-5,共5页
In a recent work [Quantum Inf. Process 12 （2013） 1077], a multi-user protocol of quantum private comparison of equality （QPCE） is presented. Here we point out that if we relax the constraint of a semi-honest third... In a recent work [Quantum Inf. Process 12 （2013） 1077], a multi-user protocol of quantum private comparison of equality （QPCE） is presented. Here we point out that if we relax the constraint of a semi-honest third party, the private information of the users will be totally leaked out to the third party. A special attack is demonstrated in detail. Furthermore, a possible improvement is proposed, which makes the protocol secure against this kind of attack. 展开更多
关键词 of in it or is on Cryptanalysis and Improvement of the Multi-User QPCE Protocol with Semi-Honest Third Party TP with
暂未订购 下载PDF
Cryptanalysis of an ergodic chaotic encryption algorithm 认领 引用 被引量：3
2
作者 王兴元 谢旖欣 秦学 《Chinese Physics B》 SCIE EI CAS CSCD 2012年第4期159-165,共7页
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 induc... 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
暂未订购 下载PDF
Cryptanalysis and improvement of a digital image encryption method with chaotic map lattices 认领 引用 被引量：3
3
作者 王兴元 刘林涛 《Chinese Physics B》 SCIE EI CAS CSCD 2013年第5期198-202,共5页
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 recove... 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
暂未订购 下载PDF
Cryptanalysis of a Cryptosystem with Non- Commutative Platform Groups 认领 引用 被引量：1
4
作者 Jinhui Liu Jianwei Jia +3 位作者 Huanguo Zhang Rongwei Yu Yong Yu Wangqing Wu 《China Communications》 SCIE CSCD 2018年第2期67-73,共7页
A cryptosystem with non-commutative platform groups based on conjugator search problem was recently introduced at Neural Computing and Applications 2016. Its versatility was illustrated by building a public-key encryp... A cryptosystem with non-commutative platform groups based on conjugator search problem was recently introduced at Neural Computing and Applications 2016. Its versatility was illustrated by building a public-key encryption scheme. We propose an algebraic key-recovery attack in the polynomial computational complexity. Furthermore, we peel off the encryption and decryption process and propose attack methods for solving the conjugator search problem over the given non-abelian group. Finally, we provide corresponding practical attack examples to illustrate the attack methods in our cryptanalysis, and provide some improved suggestions. 展开更多
关键词 cryptanalysis post-quantum com-putational cryptography conjugator searchproblem computational complexity
暂未订购 下载PDF
Cryptanalysis and improvement of quantum broadcast communication and authentication protocol with a quantum one-time pad 认领 引用 被引量：2
5
作者 刘志昊 陈汉武 《Chinese Physics B》 SCIE EI CAS CSCD 2016年第8期59-64,共6页
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 iss... 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
暂未订购 下载PDF
Cryptanalysis of Cryptosystems Based on General Linear Group 认领 引用 被引量：1
6
作者 Jianwei Jia Jinhui Liu Huanguo Zhang 《China Communications》 SCIE CSCD 2016年第6期217-224,共8页
Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certai... Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work. 展开更多
关键词 cryptography post quantum computational cryptography cryptanalysis non-abelian algebraic structures linear equations
暂未订购 下载PDF
An Analysis of International Data Encryption Algorithm(IDEA) Security against Differential Cryptanalysis 认领 引用 被引量：4
7
作者 CHEN Jia XUE Dongyue LAI Xuejia 《Wuhan University Journal of Natural Sciences》 CAS 2008年第6期697-701,共5页
The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanal... The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanalysis attack after 5 rounds while IDEA（8） needs 7 rounds for the same level of security. The transition matrix for IDEA（16） and its eigenvalue of second largest magnitude are computed. The storage method for the transition matrix has been optimized to speed up file I/O. The emphasis of the work lies in finding out an effective way of computing the eigenvalue of the matrix. To lower time complexity, three mature algorithms in finding eigenvalues are compared from one another and subspace iteration algorithm is employed to compute the eigenvalue of second largest module, with a precision of 0.001. 展开更多
关键词 international date encryption algorithm（IDEA） cipher differential cryptanalysis Markov cipher transition matrix subspace iteration
暂未订购 下载PDF
Cryptanalysis and Improvement of Digital Multisignature Scheme Based on RSA 认领 引用 被引量：1
8
作者 粟栗 崔国华 +1 位作者 陈晶 袁隽 《Journal of Southwest Jiaotong University(English Edition)》 2007年第1期8-11,共4页
Zhang et al. proposed a sequential multisignature scheme based on RSA. The scheme has advantages of low computation and communication costs, and so on. However, we find a problem in their scheme that the verifier can ... Zhang et al. proposed a sequential multisignature scheme based on RSA. The scheme has advantages of low computation and communication costs, and so on. However, we find a problem in their scheme that the verifier can not distinguish whether the multisignature is signed by all the signers of the group or only by the last signer. Thus, any single signature created by the last signer can be used as a multisignaturr created by the whole group members. This paper proposes an improved scheme that can overcome the defect. In the new scheme, the identity messages of all the signers are added in the multisignature and used in verification phase, so that the verifier can know the signature is generated by which signers. Performance analysis shows that the proposed scheme costs less computation than the original scheme in both signature and verification phases. Furthermore, each partial signature is based on the signer＇s identity certificate, which makes the scheme more secure. 展开更多
关键词 Digital multisignature Sequential multisignature RSA cryptosystem Cryptanalysis
暂未订购 下载PDF
Cryptanalysis and Improvement of a Chaotic Map-Control-Based and the Plain Image-Related Cryptosystem 认领 引用
9
作者 Bin Lu Fenlin Liu +1 位作者 Xin Ge Zhenyu Li 《Computers, Materials & Continua》 SCIE EI 2019年第8期687-699,共13页
Due to the characteristics of chaotic systems,different cryptosystems based on chaos have been proposed to satisfy the security of multimedia data.A plain image-related chaotic algorithm is proposed by Luo et al.with ... Due to the characteristics of chaotic systems,different cryptosystems based on chaos have been proposed to satisfy the security of multimedia data.A plain image-related chaotic algorithm is proposed by Luo et al.with high speed and efficiency.Security weaknesses of the cryptosystem are studied in this paper.It is found that the important secret key information is leaked because an important parameter can be obtained after an inverse operation in the last step of the cryptosystems without secret key.Meanwhile,the value zero is processed improperly in quantification algorithm.Based on the weaknesses,chosen plaintext attack on the cryptosystem is proposed,by which,an important parameter,equivalent to secret key,can be calculated with a specific chosen plain image.With the obtained parameter,the plain image of any ciphered image,encrypted by the cryptosystem,can be recovered.Then,an improvement is proposed to solve the problems after modifying the quantification algorithm.It is from the experiments that chosen plaintext attack is valid and improved algorithm possesses better performance. 展开更多
关键词 Multimedia cryptosystem cryptanalysis chaos chosen plaintext attack
暂未订购 下载PDF
Cryptanalysis of an image encryption scheme based on the Hill cipher 认领 引用
10
作者 Cheng-qing Dan ZHANG Guan-rong CHEN 《Journal of Zhejiang University-SCIENCE A》 SCIE EI CAS 2008年第8期1118-1123,共6页
This paper studies the security of an image encryption scheme based on the Hill cipher (Ismail et al., 2006) and reports its following problems: (1) There is a simple necessary and sufficient condition that makes a nu... This paper studies the security of an image encryption scheme based on the Hill cipher (Ismail et al., 2006) and reports its following problems: (1) There is a simple necessary and sufficient condition that makes a number of secret keys invalid; (2) It is insensitive to the change of the secret key; (3) It is insensitive to the change of the plain-image; (4) It can be broken with only one known/chosen plaintext; (5) It has some other minor defects. The proposed cryptanalysis discourages any use of the scheme in practice. 展开更多
关键词 Cryptanalysis Encryption Hill cipher Known-plaintext attack Chosen-plahltext attack
暂未订购 下载PDF
Cryptanalysis of Schemes Based on Pseudoinverse Matrix 认领 引用
11
作者 LIU Jinhui ZHANG Huanguo JIA Jianwei 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2016年第3期209-213,共5页
Advances in quantum computation threaten to break public key eryptosystems that are based on the difficulty of fac- torization or the difficulty of discrete logariths, although , no quantum algorithms have been found ... Advances in quantum computation threaten to break public key eryptosystems that are based on the difficulty of fac- torization or the difficulty of discrete logariths, although , no quantum algorithms have been found to be able to solve certain mathematical problems on non-commutative algebraic structures up to now. The proposed new quasi-inverse based cryptography scheme is vulnerable to a linear algebra attack based on the probable occurrence of weak keys in the generation process. In this paper, we illustrate that two of the quasi-inverse based cryptography are vulnerable to a structural attack and that it only requires polynomial time to obtain the equivalent keys for some given public keys. In addition, we conduct a detailed analysis on attack methods and provide some improved suggestions on these two schemes. 展开更多
关键词 cryptography post-quantum computational cryptography key exchange protocol cryptanalysis matrix decomposition
暂未订购 下载PDF
Cryptanalysis of One Fair E-cash System 认领 引用
12
作者 刘丽华 沈灏 《Journal of Shanghai Jiaotong university(Science)》 EI 2006年第3期389-393,共5页
The security of Canard-Traore fair e-cash system scheme was believed to depend on the strong-RSA assumption and the Decision Diffie-Hellman assumption in groups of unknown order. But it is not the case. The cryptanaly... The security of Canard-Traore fair e-cash system scheme was believed to depend on the strong-RSA assumption and the Decision Diffie-Hellman assumption in groups of unknown order. But it is not the case. The cryptanalysis on Canard-Traore fair e-cash system was presented. An algorithm was designed to show that Canard-Traore fair e-cash system is insecure: It is forgeability. Further, two drawbacks on Canard-Traore fair e-cash system scheme were pointed out. One is that those integer intervals for si（i=1,…,9） are unappropriate. The other is that the datum s3 in signature data is redundant. Moreover, a minute description of the technique to shun the challenge in the scheme was presented. The technique is helpful for designing new group signature schemes in the future. 展开更多
关键词 cryptanalysis group signature fair e-cash system forgeability
暂未订购 下载PDF
Linear-Differential Cryptanalysis for SPN Cipher Structure and AES 认领 引用
13
作者 WEI Yongzhuang HU Yupu 《Wuhan University Journal of Natural Sciences》 CAS 2007年第1期37-40,共4页
A new attack on block ciphers is introduced, which is termed linear-differential cryptanalysis. It bases the combining of linear cryptanalysis and differential cryptanalysis, and works by using linear-differential pro... A new attack on block ciphers is introduced, which is termed linear-differential cryptanalysis. It bases the combining of linear cryptanalysis and differential cryptanalysis, and works by using linear-differential probability （LDP）. Moreover, we present a new method for upper bounding the maximum linear-differential probability （MLDP） for 2 rounds of substitution permutation network （SPN） cipher structure. When our result applies to 2-round advanced encryption standard（AES）, It is shown that the upper bound of MLDP is up to 1.68×2^-19, which extends the known results for the 2-round SPN. Furthermore, when using a recursive technique, we obtain that the MLDP for 4 rounds of AES is bounded by 2^-73. 展开更多
关键词 linear-differential cryptanalysis substitution permutation network advanced encryption standard （AES）.
暂未订购 下载PDF
A New Method for Impossible Differential Cryptanalysis of 8-Round Advanced Encryption Standard 认领 引用
14
作者 CHEN Jie HU Yupu WEI Yongzhuang 《Wuhan University Journal of Natural Sciences》 EI CAS 2006年第6期1559-1562,共4页
This paper first presents an impossible differential property for 5-round Advanced Encryption Standard （AES） with high probability. Based on the property and the impossible differential cryptanalytic method for the ... This paper first presents an impossible differential property for 5-round Advanced Encryption Standard （AES） with high probability. Based on the property and the impossible differential cryptanalytic method for the 5-round AES, a new method is proposed for cryptanalyzing the 8-round AES-192 and AES-256. This attack on the reduced 8-round AES-192 demands 2^121 words of memory, and performs 2^148 8-round AES-192 encryptions. This attack on the reduced 8-round AES-256 demands 2^153 words of memory, and performs 2^180 8-round AES-256 encryptions. Furthermore, both AES-192 and AES-256 require about 2^98 chosen plaintexts for this attack, and have the same probability that is only 2^-3 to fail to recover the secret key. 展开更多
关键词 impossible differential cryptanalysis eryptanalysis Advanced Encryption Standard
暂未订购 下载PDF
Cryptanalysis of 2D-SCMCI Hyperchaotic Map Based Image Encryption Algorithm 认领 引用 被引量：1
15
作者 Mohammed S.Alshehri Sultan Almakdi +1 位作者 Mimonah Al Qathrady Jawad Ahmad 《Computer Systems Science & Engineering》 SCIE EI 2023年第8期2401-2414,共14页
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 encryp... 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
暂未订购 下载PDF
Cryptanalysis of Threshold-proxy Threshold-signature Schemes 认领 引用 被引量：1
16
作者 HAN Jin-guang KANG Bao-yuan 《Chinese Quarterly Journal of Mathematics》 2010年第3期459-463,共5页
Recently,Hwang et al.proposed a （t,n） threshold-proxy （c,m） thresholdsignature schemes,in which only any t or more original signers of n original signers can authorize a proxy group of m proxy signers and then onl... Recently,Hwang et al.proposed a （t,n） threshold-proxy （c,m） thresholdsignature schemes,in which only any t or more original signers of n original signers can authorize a proxy group of m proxy signers and then only c or more proxy signers can cooperatively generate threshold-proxy threshold-signature.In this scheme,they claimed that original signers cannot forge the proxy signature and the proxy signers cannot forge signature on behalf of the original signers.However,in this paper,we will give a attack to show that their scheme can not resist impersonation attacks. 展开更多
关键词 cryptanalysis impersonate attacks threshold-proxy threshold-signature
暂未订购 下载PDF
CRYPTANALYSIS OF AN EXTENDED MQ SIGNATURE SYSTEM HTTM 认领 引用
17
作者 Jing Zhengjun Yu Zhimin +2 位作者 Gu Chunsheng Wu Fangsheng Zhao Xiaorong 《Journal of Electronics(China)》 2013年第5期491-499,共9页
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.pro... 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. 展开更多
关键词 Multivariate Quadratic(MQ) problem Cryptanalysis Equivalent private key Forging signature Hash-based Tame Transformation and Minus(HTTM
暂未订购 下载PDF
Unified Impossible Differentia Cryptanalysis of ARIA 认领 引用
18
作者 Xue Weijia Lai Xuejia 《China Communications》 SCIE CSCD 2012年第8期129-134,共6页
Unified Irrpossible Differential(UID)cryptanalysis is a systeimtic method for finding impossible differentials for block ciphers.Regarding to the problem of automatically retrieving the impossible differential charact... Unified Irrpossible Differential(UID)cryptanalysis is a systeimtic method for finding impossible differentials for block ciphers.Regarding to the problem of automatically retrieving the impossible differential characteristics of block ciphers,with the use of particular intermediate difference state expression,UID gets the same or better results compared with other present cryptanalysis results.ARIA is a Korean block cipher expecting that there are no impossible differentials on four or rmre rounds.Based on a property of the Diffusion layer(DL)of ARIA,a specific selection is used before conflict searching to optimize.UID is applied to ARIA,and 6721 impossible differential chains are found.The length of those chains is four rounds,the same as eisting results,but more varied in form Moreover,ARIA is a Substitution-Penmtation Network(SPN),not a Feistel structure or generalized Feistel structure as UID was applied to before. 展开更多
关键词 impossle differential cryptanalysis unified impossble differential ARIA block cipher
暂未订购 下载PDF
A survey on the Metaheuristics for Cryptanalysis of Substitution and Transposition Ciphers 认领 引用
19
作者 Arkan Kh Shakr Sabonchi Bahriye Akay 《Computer Systems Science & Engineering》 SCIE EI 2021年第10期87-106,共20页
This paper presents state-of-art cryptanalysis studies on attacks of the substitution and transposition ciphers using various metaheuristic algorithms.Traditional cryptanalysis methods employ an exhaustive search,whic... This paper presents state-of-art cryptanalysis studies on attacks of the substitution and transposition ciphers using various metaheuristic algorithms.Traditional cryptanalysis methods employ an exhaustive search,which is computationally expensive.Therefore,metaheuristics have attracted the interest of researchers in the cryptanalysis field.Metaheuristic algorithms are known for improving the search for the optimum solution and include Genetic Algorithm,Simulated Annealing,Tabu Search,Particle Swarm Optimization,Differential Evolution,Ant Colony,the Artificial Bee Colony,Cuckoo Search,and Firefly algorithms.The most important part of these various applications is deciding the fitness function to guide the search.This review presents how these algorithms have been implemented for cryptanalysis purposes.The paper highlights the results and findings of the studies and determines the gaps in the literature. 展开更多
关键词 Cryptanalysis metaheuristic algorithms substitution cipher transposition cipher
暂未订购 下载PDF
Cryptanalysis of Two Pseudo-attacks from the Same Mathematic Mistake 认领 引用
20
作者 刘杰 施建俊 李建华 《Journal of Shanghai Jiaotong university(Science)》 EI 2007年第3期394-396,共3页
Yang and Shieh proposed a timestamp-hased password authentication scheme. Fan and Shen gave differ- ent improvements on it. Wang claimed that Fan＇s improvement is insecure and gave his attack. Yang did the simi- lar ... Yang and Shieh proposed a timestamp-hased password authentication scheme. Fan and Shen gave differ- ent improvements on it. Wang claimed that Fan＇s improvement is insecure and gave his attack. Yang did the simi- lar things on Shen＇s scheme. This paper gave further cryptanalysis on Wang＇s and Yang＇s attacks and pointed out that both of their attacks are infeasible. Wang and Yang made the same mathematic mistake and their attacks are pseudo. 展开更多
关键词 password authentication cryptanalysis number theory
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 5 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈