Score:3

Text to Divisor Class Encoding in Hyperelliptic Curve Cryptography

cc flag

When trying to implement ElGamal Public Key Encryption using Hyperelliptic Curves, one needs to map the message that will be encrypted to a valid Divisor (in my case in the Mumford representation, which is the most common).

I have not found any specific methods similar to Koblitz encodings in ECC. Are there any methods out there that can be presented in a more algorithmic way so that they can be implemented in code?

Daniel S avatar
ru flag
There's [Deterministic Encoding and Hashing to Odd Hyperelliptic Curves](https://eprint.iacr.org/2010/382.pdf) by Fouque and Tibouchi.
PanosDgs avatar
cc flag
This works, but only for Odd Hyperelliptic Curves. I want something more generic like this https://link.springer.com/chapter/10.1007/978-3-319-89339-6_11 however this still limits the type of curves that can be used. I was wondering if a typical Koblitz encoding from byte to point in the HEC and then to Divisor in Mumford representation can be used in this case and if not, why? Any ideas?
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.