Skip to main content

A New Hard Problem over Non-commutative Finite Groups for Cryptographic Post-quantum signature algorithms based on the hidden discrete logarithm problem

  • Moldovyan N
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.

Cite

CITATION STYLE

APA

Moldovyan, N. A. (2018). A New Hard Problem over Non-commutative Finite Groups for Cryptographic Post-quantum signature algorithms based on the hidden discrete logarithm problem. Computer Science Journal of Moldova, 26(September 2010).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free