Skip to main content
placeholder image

On Using Fast Exponentiation Algorithm in PDAs (or: How Secure is the Discrete Logarithm Problem Assumption in PDAs?)

Conference Paper


Download full-text (Open Access)

Abstract


Publication Date


  • 2003

Citation


  • Susilo, W., Huang, J. & Seberry, J. R. (2003). On Using Fast Exponentiation Algorithm in PDAs (or: How Secure is the Discrete Logarithm Problem Assumption in PDAs?). In H. Arabnia & Y. Mun (Eds.), Proceedings of the International Conference on Security and Management. SAM''03 Volume II (pp. 668-674). USA: CSREA Press.

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1303&context=infopapers

Ro Metadata Url


  • http://ro.uow.edu.au/infopapers/304

Start Page


  • 668

End Page


  • 674

Place Of Publication


  • USA

Abstract


Publication Date


  • 2003

Citation


  • Susilo, W., Huang, J. & Seberry, J. R. (2003). On Using Fast Exponentiation Algorithm in PDAs (or: How Secure is the Discrete Logarithm Problem Assumption in PDAs?). In H. Arabnia & Y. Mun (Eds.), Proceedings of the International Conference on Security and Management. SAM''03 Volume II (pp. 668-674). USA: CSREA Press.

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1303&context=infopapers

Ro Metadata Url


  • http://ro.uow.edu.au/infopapers/304

Start Page


  • 668

End Page


  • 674

Place Of Publication


  • USA