Journal of Software, Vol 6, No 9 (2011), 1873-1880, Sep 2011
doi:10.4304/jsw.6.9.1873-1880

A RSA Key Security Gradating Algorithm Based on Threshold Attack Time

Wenxue Tan, Jinju Xi, Xiping Wang

Abstract


In this paper, we pioneer a key security level gradation scheme which is proved to efficient to counteract Iterative-Encrypting-Attack against RSA. And we make it clear that the bug which hides after the traditional key generation algorithm is exploited by Iterative-Encrypting-Attack and weakens RSA security, and that the case can be improved if the traditional key generation algorithm is modified delicately. After analyzing the preliminary and practical steps of Iterative Encrypting Attack in detail, we propose the concept of security grade of key-pair and depict the hierarchy of grades systematically, and bring forward an algorithm that grades security grade of key pairs. Furthermore, we introduce the concept of attack cost into the gradation prototype, then program for grading algorithm and set in motion a series of experiments for surveying the relationship between attack-cost and key-security-grade. At last, by the attained result from experimental statistics, we point it out  that if key-pair is properly chosen RSA system can acquire a satisfying immunity from Iterative Encrypting Attack.


Keywords


Iterative Encrypting Attack ; Security Grade; Attack Time Cost; Threshold Time; RSA.

References


[1] L. Kai-cheng, Computer Cryptograph:data secutity and privacy of computer network, ser. combinatorics in Computer Science. PeiKing,TsingHua University Press, 2003, vol. 7302075363, ch. The Role of Trust Management in Distributed Systems Security.

[2] A. S. Yevgeniy Dodis, Amit Sahai, “On perfect and adaptive security in exposure resilient cryptography,” in Proceedings of Eurocrypt, Mar. 2001.

[3] V. S. J.Algesheimer, J. Camenisch, “Efficient computation modulo a shared secret with application to the generation of shared safe-prime products,” in Proceedings of crypto’2002, May 2002.

[4] J. S. P. Nguyen, “ Lattice reduction in cryptology: an update. In Algorithmic Number Theory,” in Proceedings of The 4th Algorithmic Number Theory Symposium, 2000.

[5] William.Stallings, Cryptography and Network Security: principles and Practices, (4th version, English). Publisher: Prentice Hall, 2006, vol. 3642077102, ch. Principles of Cryptography .

[6] S. Y. Yan, Number Theory for Computing (2nd version, English), ser. combinatorics in Computer Science. Springer, 2002, vol. 3642077102, ch. Computational (Algorithmic) Number Theory .

[7] G. D. Boneh, “Cryptanalysis of RSA with private key d less than N 0.292,” IEEE Transactions on Information Theory, vol. 46, no. 4, Apr. 2000.
http://dx.doi.org/10.1109/18.850673

[8] Y. Z. R. Steinfeld, “An advantage of low-exponent RSA with modulus primes sharing least significant bits,” in Proceedings of RSA Conference 2001, Feb. 2001.

[9] K.ManuelL.Joachim, “Hardware Software Co-design of Elliptic curve Cryptography on an 8051 Mierocontroller,” in Proceedings of Cryptographic Hardware and Embedded Systems, Oct. 2006.

[10] D. Boneh, “smooth integers using CRT decoding,” in Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 2000.
http://dx.doi.org/10.1145/335305.335337

[11] S. H. E. K. A. S. R. Canetti, Y. Dodis, “Exposure-Resilient Functions and All-or-Nothing Transforms,” in Proceedings of Eurocrypt 2000, Aug. 2000.

[12] N. C. J. Camenisch, “A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks,” in Proceedings of Eurocrypt 2009, Apr. 2009.

[13] C. F.R-Henriquez, “Parallel MultiPliers Based on Special Irreducible Pentanomials,” IEEE Transactions on Computers, vol. 52, no. 12, Dec. 2004.

[14] P. Y. Y. Y. X. CHEN Huafeng, SHEN Haibin, “Characteristics of Parameterized Chaotic Map on Security and Implementation,” Chinese Journal of Electronics, vol. 16, no. 4, Apr. 2007.

[15] C. Q. Zhao Yonghua, Chi Xuebin, “Efficient Algorithms for Matrix Eigenproblem Solver on SMP Cluster,” Journal of Computer Research and Development, vol. 44, no. 2, Feb. 2007.


Full Text: PDF


Journal of Software (JSW, ISSN 1796-217X)

Copyright @ 2006-2012 by ACADEMY PUBLISHER – All rights reserved.