Abstract
The high security for RSA cryptosystem depends on the less power of attacks broken it. This subject can be reduced to find the prim numbers and integer factors. Any attack besides the brute force attack, may succeed and obtain plaintext or private key. So, it is necessary to keep the RSA cryptosystem security against attacks. In this paper, we proposed a formal cryptanalysis for RSA cryptosystem, by term rewriting systems (TRS) and termination proving. We have embedded one RSA attack in a TRS model, such that attack has been successes on the RSA cryptosystem if and only if its TRS model has been terminated. Since the automated termination proving of TRSs has been grown in the last years, our work will promise.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Rivest R, Shamir A, Adelman L (1978) A method for obtaining digital signature and public key cryptosystem. Commun ACM 21:120–126
Bonte S (1999) Twenty years of attack on the RSA cryptosystem. Not Am Math Soc 46(2):203–213
Itoh K, Kunihiro N, Kurosawa K (2008) Small secret key attack on a variant of RSA. In: Malkin T (ed) CT-RSA’2008. LNCS, vol 4964, pp 387–406
Bellare M, Rogaway P (1995) Optimal asymmetric encryption–how to encrypt with RSA. In: Santis AD (ed) ERUOCRYPT’94, LNCS, vol 950, pp 92–111
Aboud SJ (2009) An efficient method for attack RSA scheme. In: IEEE, No 978, pp 587–592
Yan SY (2008) Cryptanalytic attacks on RSA, Springer, New York
Boneh D, Durfee G, Frankel Y (1998) An attack on RSA given a small fraction of the private key bit. In: Ohta K, Pei D (eds) ASIACRYPT’98, LNCS, vol 1514, pp 25–34
Mousa A (2005) Sensitivity of changing the RSA parameters on the complexity and performance of the algorithm. In: Journal of Applied Science, Asian Network for Scientific Information, pp 60–63
Wiener M (1990) Cryptanalysis of short RSA secret exponents. IEEE Trans Inf Theory 36:553–558
Boneh D, Durfee G (2000) Cryptanalysis of RSA with private key d less than N0:292. IEEE Trans Inf Theory 46(4):1339–1349
Pomerance C (1996) A tale of two sieves. Not Am Math Soc 43:1473–1485
Shor P (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SICOMP 26(5):1484–1509
Menezes AJ, Oorschot PV, Vanstone S (1997) Handbook of applied cryptography. CRC Press, Boca Raton
Baader F, Nipkow T (1998) Term rewriting and all that. Cambridge University Press, Cambridge
Zantema H (2004) Torpa: termination of rewriting proved automatically. In: Oostrom V (ed) RTA’11, LNCS, vol 3091, pp 95–104
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Kadkhoda, M., Vosoogh, A., Nourmandi-Pour, R. (2016). A Formal Analysis for RSA Attacks by Term Rewriting Systems. In: Balas, V., C. Jain, L., Kovačević, B. (eds) Soft Computing Applications. SOFA 2014. Advances in Intelligent Systems and Computing, vol 356. Springer, Cham. https://doi.org/10.1007/978-3-319-18296-4_50
Download citation
DOI: https://doi.org/10.1007/978-3-319-18296-4_50
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18295-7
Online ISBN: 978-3-319-18296-4
eBook Packages: EngineeringEngineering (R0)