International Journal of Communications, Network and System Sciences

Vol.3 No.8(2010), Paper ID 2513, 6 pages

DOI:10.4236/ijcns.2010.38086

 

Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems

 

Boris S. Verkhovsky

 

 

Copyright © 2010 Boris S. Verkhovsky et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

How to Cite this Article


B. Verkhovsky, "Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems," International Journal of Communications, Network and System Sciences, Vol. 3 No. 8, 2010, pp. 639-644. doi: 10.4236/ijcns.2010.38086.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.