oalib
匹配条件: “” ,找到相关结果约100条。
列表显示的所有文章,均可免费获取
第1页/共100条
每页显示
Cryptanalysis of the CFVZ cryptosystem  [PDF]
J. J. Climent,E. Gorla,J. Rosenthal
Computer Science , 2006,
Abstract: The paper analyzes a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the complexity of solving the underlying problem for the proposed system is dominated by the complexity of solving a fixed number of discrete logarithm problems in the group of an elliptic curve. Using an adapted Pollard rho algorithm it is shown that this problem is essentially as hard as solving one discrete logarithm problem in the group of an elliptic curve.
Cryptanalysis of a new chaotic cryptosystem based on ergodicity  [PDF]
David Arroyo,Gonzalo Alvarez,Shujun Li,Chengqing Li,Veronica Fernandez
Physics , 2008, DOI: 10.1142/S0217979209049966
Abstract: This paper analyzes the security of a recent cryptosystem based on the ergodicity property of chaotic maps. It is shown how to obtain the secret key using a chosen-ciphertext attack. Some other design weaknesses are also shown.
Cryptanalysis of a Public-key Cryptosystem Using Lattice Basis Reduction Algorithm  [PDF]
Roohallah Rastaghi,Hamid R. Dalili Oskouei
Computer Science , 2012,
Abstract: We proposed a new attack against Hwang et al.'s cryptosystem. This cryptosystem uses a super-increasing sequence as private key and the authors investigate a new algorithm called permutation combination algorithm to enhance density of knapsack to avoid the low-density attack. Sattar J. Aboud [Aboud j. Sattar, "An improved knapsack public key cryptography system", International Journal of Internet Technology and Secured Transactions, Vol.3 (3), pp.310-319, 2011] used Shamir's attack on the basic Merkle-Hellman cryptosystem to break this cryptosystem. In this paper, we introduce a direct attack against Hwang et al.'s cryptosystem based on Lattice basis reduction algorithms. By computing complexity of propose attack, we show that unlike Aboud's cryptanalysis, our cryptanalysis is more efficient and practicable.
Cryptanalysis and Improvement of Akleylek et al.'s cryptosystem  [PDF]
Roohallah Rastaghi
Computer Science , 2013,
Abstract: Akleylek et al. [S. Akleylek, L. Emmungil and U. Nuriyev, A mod ified algorithm for peer-to-peer security, journal of Appl. Comput. Math., vol. 6(2), pp.258-264, 2007.], introduced a modified public-key encryption scheme with steganographic approach for security in peer-to-peer (P2P) networks. In this cryptosystem, Akleylek et al. attempt to increase security of the P2P networks by mixing ElGamal cryptosystem with knapsack problem. In this paper, we present a ciphertext-only attack against their system to recover message. In addition, we show that for their scheme completeness property is not holds, and therefore, the receiver cannot uniquely decrypts messages. Furthermore, we also show that this system is not chosen-ciphertext secure, thus the proposed scheme is vulnerable to man-in-the-middle-attack, one of the most pernicious attacks against P2P networks. Therefore, this scheme is not suitable to implement in the P2P networks. We modify this cryptosystem in order to increase its security and efficiency. Our construction is the efficient CCA2-secure variant of the Akleylek et al.'s encryption scheme in the standard model, the de facto security notion for public-key encryption schemes.
Cryptanalysis of a novel cryptosystem based on chaotic oscillators and feedback inversion  [PDF]
G. Alvarez,L. Hernandez,F. Montoya,J. Munoz
Physics , 2003, DOI: 10.1016/j.jsv.2003.10.031
Abstract: An analysis of a recently proposed cryptosystem based on chaotic oscillators and feedback inversion is presented. It is shown how the cryptosystem can be broken when Duffing's oscillator is considered. Some implementation problems of the system are also discussed.
Cryptanalysis of a New Knapsack Type Public-Key Cryptosystem  [PDF]
Roohallah Rastaghi
Computer Science , 2012,
Abstract: Recently, Hwang et al. introduced a knapsack type public-key cryptosystem. They proposed a new algorithm called permutation combination algorithm. By exploiting this algorithm, they attempt to increase the density of knapsack to avoid the low-density attack. We show that this cryptosystem is not secure, as it based on basic Merkel-Hellman knapsack cryptosystem and because of the superincreasing structure, we can use shamir's attack on the basic Merkel-Hellman knapsack to break this cryptosystem.
Cryptanalysis of a Convertible Authenticated Encryption Scheme Based on the ElGamal Cryptosystem
Li Fagen,Qin Zhiguang
IETE Technical Review , 2010,
Abstract: A convertible authenticated encryption scheme allows a designated recipient to retrieve an authenticated ciphertext and convert the authenticated ciphertext into an ordinary signature. Recently, Lee, Hwang, and Tzeng proposed a new convertible authenticated encryption scheme based on the ElGamal cryptosystem. In this paper, we show that the Lee-Hwang-Tzeng scheme is not secure against chosen plaintext attacks. In addition, we give a solution to repair it.
Kahler moduli double inflation  [PDF]
Masahiro Kawasaki,Koichi Miyamoto
Physics , 2010, DOI: 10.1088/1475-7516/2011/02/004
Abstract: We show that double inflation is naturally realized in K\"ahler moduli inflation, which is caused by moduli associated with string compactification. We find that there is a small coupling between the two inflatons which leads to amplification of perturbations through parametric resonance in the intermediate stage of double inflation. This results in the appearance of a peak in the power spectrum of the primordial curvature perturbation. We numerically calculate the power spectrum and show that the power spectrum can have a peak on observationally interesing scales. We also compute the TT-spectrum of CMB based on the power spectrum with a peak and see that it better fits WMAP 7-years data.
Cryptosystem for Information Security
Samir Kumar Bandyopadhyay,,Somaditya Roy
International Journal on Computer Science and Engineering , 2010,
Abstract: This paper introduces a symmetric cryptosystem for information. Algorithms are described for implementing the proposed method. Cryptanalysis of the proposed scheme is reported along with similar analysis for two popular systems – DES and AES.
Cryptanalysis of a Public-key Cryptosystem Using Lattice Basis Reduction Algorithm
Roohallah Rastaghi,Hamid R. Dalili Oskouei
International Journal of Computer Science Issues , 2012,
Abstract: In this manuscript, we proposed a new attack against Hwang et al.s cryptosystem. This cryptosystem uses a super-increasing sequence as private key and the authors investigate a new algorithm called permutation combination algorithm to enhance density of knapsack to avoid the low-density attack. Sattar J. Aboud [Aboud j. Sattar, An improved knapsack public key cryptography system, International Journal of Internet Technology and Secured Transactions, Vol.3 (3), pp.310-319,2011] used Shamirs attack on the basic Merkle-Hellman cryptosystem to break this cryptosystem. Due to use of Lensteras integer programming, Lagarias showed that Shamirs attack is inefficient in practice; So, Abouds attack is impractical too.
第1页/共100条
每页显示


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.