The Threat of a Deterministic Polynomial Time Algorithm for Primality Testing in Applied Cryptography

Charlie Obimbo, Stephen Doxsee. The Threat of a Deterministic Polynomial Time Algorithm for Primality Testing in Applied Cryptography. In Hamid R. Arabnia, Rose Joshua, Iyad A. Ajwa, George A. Gravvanis, editors, Proceedings of the International Conference on Modeling, Simulation & Visualization Methods, MSV 04 & Proceedings of the International Conference on Algorithmic Mathematics & Computer Science, AMCS 04, June 21-24, 2004, Las Vegas, Nevada, US. pages 423-426, CSREA Press, 2004.

@inproceedings{ObimboD04,
  title = {The Threat of a Deterministic Polynomial Time Algorithm for Primality Testing in Applied Cryptography},
  author = {Charlie Obimbo and Stephen Doxsee},
  year = {2004},
  tags = {testing},
  researchr = {https://researchr.org/publication/ObimboD04},
  cites = {0},
  citedby = {0},
  pages = {423-426},
  booktitle = {Proceedings of the International Conference on Modeling, Simulation & Visualization Methods, MSV  04 & Proceedings of the International Conference on Algorithmic Mathematics & Computer Science, AMCS  04, June 21-24, 2004, Las Vegas, Nevada, US},
  editor = {Hamid R. Arabnia and Rose Joshua and Iyad A. Ajwa and George A. Gravvanis},
  publisher = {CSREA Press},
  isbn = {1-932415-34-3},
}