Paper 2023/1116
Applying system of equations to factor semiprime numbers
Abstract
This paper explores the use of a system of equations to factor semiprime numbers. Semiprime numbers are a special type of omposite number that are the product of two prime numbers. Factoring semiprime numbers is important in cryptography and number theory. In this study, we present a method that applies a system of polynomial equations to factor semiprime number $M$. Where $M$ can be any semiprime number. In fact, we build a family of systems where each system compose from three polynomial equations with three variables. The results of this study show that a solution for one system results with a complete factorization for a semiprime number. It may be possible to apply well known algorithms, such as Grobner method to solve one of those systems for a particular semiprime number $M$.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Minor revision. London Journal of Research in Computer Science and Technology Volume 23 Issue 2 Ӏ Compilation 1.0
- Keywords
- semiprimefactorizationsystem of equations
- Contact author(s)
- yz11235 @ gmail com
- History
- 2023-07-18: approved
- 2023-07-18: received
- See all versions
- Short URL
- https://ia.cr/2023/1116
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1116,
author = {Yonatan Zilpa},
title = {Applying system of equations to factor semiprime numbers},
howpublished = {Cryptology ePrint Archive, Paper 2023/1116},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/1116}},
url = {https://eprint.iacr.org/2023/1116}
}
