Subject

Sort by: Order: Results:

  • Are Matrices Useful in Public-Key Cryptography? 
    MAHALANOBIS, AYAN (Hikari, 2013-01)
    The discrete logarithm problem is the most prolific cryptographic primitive in use. Though the most important ones are the DiffieHellman problem and the decision Diffie-Hellman problem. In this paper, we discuss the discrete ...