Integer factoring and compositeness witnesses

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer Factoring

Using simple examples and informal discussions this article surveys the key ideas and major advances of the last quarter century in integer factorization.

متن کامل

General purpose integer factoring

This chapter describes the developments since 1970 in general purpose integer factoring and highlights the contributions of Peter L. Montgomery. This article appeared as Chapter 5 of the book Topics in Computational Number Theory inspired by Peter L. Montgomery, edited by Joppe W. Bos and Arjen K. Lenstra and published by Cambridge University Press. See www. cambridge.org/9781107109353. There a...

متن کامل

Integer Factoring with Extra Information

In this paper we present an heuristic algorithm and its implementation in C++ program for integer factoring with high-order bits known based on lattice reduction techniques. Our approach is inspired in algorithms for predicting pseudorandom numbers.

متن کامل

Integer Factoring Utilizing PC Cluster

The integer factoring problem is one of the oldest and important problems and it is considered as hard, i.e., the problem cannot be solved in polynomial time for the worst case, because the security of RSA is heavily dependent on the difficulties of integer factoring. As is well known, hardware technology is progressing rapidly from year to year and it seems that the time is now ripe to factor ...

متن کامل

Integer factoring and modular square roots

Buresh-Oppenheim proved that the NP search problem to find nontrivial factors of integers of a special form belongs to Papadimitriou’s class PPA, and is probabilistically reducible to a problem in PPP. In this paper, we use ideas from bounded arithmetic to extend these results to arbitrary integers. We show that general integer factoring is reducible in randomized polynomial time to a PPA probl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Cryptology

سال: 2020

ISSN: 1862-2984,1862-2976

DOI: 10.1515/jmc-2019-0023