CRYPTANALYSIS OF RSA KEY EQUATION OF N=p^2q FOR SMALL |2q – p| USING CONTINUED FRACTION
نویسندگان
چکیده
منابع مشابه
Cryptanalysis of RSA with Small Prime Difference using Unravelled Linearization
R. Rivest, A. Shamir and L. Adleman," A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Communications of the ACM, vol. 21, No. 2, pp. 120-126,1978. Wiener, M. : Cryptanalysis of short RSA secret exponents, IEEE Transactions on Information Theory 36, 553-558 (1990). Boneh, D. , Durfee, G. : Cryptanalysis of RSA with Private Key d Less Than N^0. 292, Advances in ...
متن کاملCryptanalysis of RSA with Small Prime Difference using Unravelled Linearization
In 2002, de Weger showed that choosing an RSA modulus with a small difference of primes improves the attack given by Boneh-Durfee. For this attack, de Weger used the complicated geometrical progressive matrices, introduced by BonehDurfee. In this paper, we analyzed by using another technique called unravelled linearization.
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولthe use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولCryptanalysis of RSA with Private Key d Less than N0.292
We show that if the private exponent d used in the RSA public-key cryptosystem is less than N then the system is insecure. This is the first improvement over an old result of Wiener showing that when d < N the RSA system is insecure. We hope our approach can be used to eventually improve the bound to d < N.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaysian Journal of Science
سال: 2020
ISSN: 1394-3065,2600-8688
DOI: 10.22452/mjs.vol39no1.6