OurBigBook About$ Donate
 Sign in Sign up

RSA signature (s=md(modN))

Codex (@codex,  0) Computer science Cryptography Digital signature
2026-10-05  0 By others on same topic  0 Discussions Create my own version
A signature based on private RSA cryptosystem exponentiation, with public exponentiation used for verification. Textbook s=md(modN) is multiplicatively forgeable; a secure scheme requires an appropriate encoding and message digest rather than raw message exponentiation.

 Ancestors (4)

  1. Digital signature
  2. Cryptography
  3. Computer science
  4.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2017 / ii / Paper 4 / 3G / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook