Score:0

Chaum–Pedersen Protocol explanation for dummies. What I'm doing wrong?

sd flag

The screenshot from a book with Chaum–Pedersen Protocol description is below.

Chaum–Pedersen Protocol description

I'm trying to implement it for my own. And I don't get math here.

My assumptions:

  1. Discrete Logarythm functions:

Discrete Logarythm

  1. The dot in the formula below is a usual multiplication: 2 • 2 = 4

Examples:

Example 1

Example 2

Score:0
sa flag

Your parameters do not satisfy the assumptions for the protocol.

To have $g$ and $h$ generate groups of prime order $q$ they must belong to such a group.

So $q$ (which in reality must be picked large enough for DL to be hard) must be a prime larger than both $g$ and $h$. So $q$ must be larger than 7919.

Maksim Danilau avatar
sd flag
Thanks! You're definitely right. Also, I found the same question with great [explanation](https://crypto.stackexchange.com/questions/99262/chaum-pedersen-protocol).
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.