Related Concepts
Definition
Nyberg–Rueppel Signature Scheme is a signature scheme proposed in the paper “Message recovery for signature schemes based on the discrete logarithm problem” in 1995.
Theory
The following gives a typical interpretation of the Nyberg–Rueppel signature scheme:
Key generation: a prime number p, a prime factor q of p − 1, an element g of order q in the group of integers modulo p, and a secret key x(0 < x < q). The public key consists of p, q, g, and \(y = {g}^{x}\textrm{ mod}\,p\) (modular arithmetic).
Signing: for message m, compute \(r = m \cdot {g}^{k}\ \textrm{ mod}\ p,\ \acute{\textrm{ r}} = r\) mod \(q,\ s = -k - {r}^{{\prime}}\cdot x\) mod q, and output (r, s). Verification: verify s < q, compute \({r}^{{\prime}} = r\) mod q, and check that \({g}^{s} \cdot {y}^{{r}^{{\prime}} }\cdot r = m\).
From the construction, it is clear that if a valid signature (r, s) for m is given, then \((r,s + t\ \textrm{...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Nyberg K, Rueppel RA (1995) Message recovery for signature schemes based on the discrete logarithm problem. In: De Santis A (ed) Advances in Cryptology—Eurocrypt’94, Lecture notes in computer science, vol 950. Springer, Berlin, pp 182–193
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Sako, K. (2011). Nyberg–Rueppel Signature Scheme. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_20
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering