Sign up ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

I spent all day trying to figure ring signature schemes out but apparently I wasted time.
I read the original ring signature paper (Rivest's How to leak a secret).
I'm having numerous problems. Let's just say that a nice and simple example would make everything clear.

I'm talking about something like this example for RSA.

The problem is that no one provides this. I read 12 papers and… nothing. I would like to have an example with small numbers. Is this even possible? Could you provide such a “toy” example?

If I can be more specific: my problem with the original paper is step 4:

solve for…

I have no idea how to solve an equation where on the left side I have the encryption (known key) of an unknown value and a value on the right side.

share|improve this question
In textbook RSA, one solves an equation of the form $x^e\bmod N=c$ with on the left side the encryption (known key) of an unknown value $x$ and a known value $c$ on the right side, by applying the textbook RSA decryption function: $x=c^d\bmod N$ where $d$ is the private exponent. I have no idea if this will help you, and that's not intended to be an answer. –  fgrieu 20 hours ago

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.