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

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: Mar. 29, 2024. [Online]. Available: https://journalofbabylon.com/index.php/JUBPAS/article/view/740
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: Mar. 29, 2024. [Online]. Available: https://journalofbabylon.com/index.php/JUBPAS/article/view/740

Similar Articles

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

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 9 10 > >>