- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
A Proposed Factorization Polynomails MOD P Algorithm | ||
| Baghdad College of Economic sciences University | ||
| Article 1, Volume 0, Issue 27, 2018, Pages 431-439 | ||
| Author | ||
| Haythem Ghani Ahmed | ||
| Abstract | ||
| Polynomials factorization is very important in applied mathematics cryptography applications .There are many algorithms in this approach like Cantr-Zassenhaus algorithm and Berlekamp's algorithm. In this research we present a new approach for factorization polynomials mod a prime number p, the efficiency of the new algorithm that we present here depend on group of hyperelliptic curve. | ||
|
Statistics Article View: 212 PDF Download: 146 |
||