A Proposed Solution to Polynomial Factorization Over Prime Finite Field Public Key Cryptography

Main Article Content

sattar Bader SadKhan
Abdul Sattar Salman

Abstract

See pdf Please 

Article Details

Section

Articles

How to Cite

[1]
“A Proposed Solution to Polynomial Factorization Over Prime Finite Field Public Key Cryptography”, JUBPAS, vol. 1, no. 3, pp. 310–313, Jan. 2018, Accessed: May 24, 2025. [Online]. Available: https://www.journalofbabylon.com/index.php/JUBPAS/article/view/740

Similar Articles

You may also start an advanced similarity search for this article.