New Prime Factorization Algorithm and Its Parallel Computing Strategy

DOI

10.2991/icitel-15.2016.27How to use a DOI?

Keywords

Distribted Computation; prime factorization; parallel computing

Abstract

Prime factorization is vitally important for mathematics and RSA security system. In this paper we present a new algorithm to factorize numbers and a new parallel strategy for prime factorization, which may help to find the fault of RSA system and design safer RSA keys, and to arise the discussion about the safety of RSA security system.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Lican Huang
PY  - 2016/03
DA  - 2016/03
TI  - New Prime Factorization Algorithm and Its Parallel Computing Strategy
BT  - Proceedings of the 1st International Conference on Information Technologies in Education and Learning
PB  - Atlantis Press
SP  - 118
EP  - 121
SN  - 2352-538X
UR  - https://doi.org/10.2991/icitel-15.2016.27
DO  - 10.2991/icitel-15.2016.27
ID  - Huang2016/03
ER  -