Paper 2009/091

Knapsack Cryptosystem on Elliptic Curves

Koichiro Noro and Kunikatsu Kobayashi

Abstract

The LLL algorithm is strong algorithm that decrypts the additional type Knapsack cryptosystem. However, the LLL algorithm is not applicable in the addition in the group that rational points of elliptic curves on finite fields do. Therefore, we think the Knapsack cryptosystem constructed on elliptic curves. By using the pairing for the decryption, it is shown to be able to make the computational complexity of the decryption a polynomial time by making the decryption function by the pairing values.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Knapsack cryptosystemelliptic curvespairingdecryption function
Contact author(s)
qq0641q6 @ cna ne jp
History
2009-02-24: received
Short URL
https://ia.cr/2009/091
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/091,
      author = {Koichiro Noro and Kunikatsu Kobayashi},
      title = {Knapsack Cryptosystem on Elliptic Curves},
      howpublished = {Cryptology ePrint Archive, Paper 2009/091},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/091}},
      url = {https://eprint.iacr.org/2009/091}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.