In cryptography, the Rabin signature algorithm is a method of digital signature originally proposed by Michael O. Rabin in 1978.[1][2][3]
The Rabin signature algorithm was one of the first digital signature schemes proposed. By introducing the use of hashing as an essential step in signing, it was the first design to meet what is now the modern standard of security against forgery, existential unforgeability under chosen-message attack, assuming suitably scaled parameters.
Rabin signatures resemble RSA signatures with 'exponent ', but this leads to qualitative differences that enable more efficient implementation[4] and a security guarantee relative to the difficulty of integer factorization,[2][3][5] which has not been proven for RSA.
However, Rabin signatures have seen relatively little use or standardization outside IEEE P1363[6] in comparison to RSA signature schemes such as RSASSA-PKCS1-v1_5 and RSASSA-PSS.
^Rabin, Michael O. (1978). "Digitalized Signatures". In DeMillo, Richard A.; Dobkin, David P.; Jones, Anita K.; Lipton, Richard J. (eds.). Foundations of Secure Computation. New York: Academic Press. pp. 155–168. ISBN 0-12-210350-5.
^ abRabin, Michael O. (January 1979). Digitalized Signatures and Public Key Functions as Intractable as Factorization(PDF) (Technical report). Cambridge, MA, United States: MIT Laboratory for Computer Science. TR-212.
^ abBellare, Mihir; Rogaway, Phillip (May 1996). Maurer, Ueli (ed.). The Exact Security of Digital Signatures—How to Sign with RSA and Rabin. Advances in Cryptology – EUROCRYPT ’96. Lecture Notes in Computer Science. Vol. 1070. Saragossa, Spain: Springer. pp. 399–416. doi:10.1007/3-540-68339-9_34. ISBN 978-3-540-61186-8.
^Bernstein, Daniel J. (January 31, 2008). RSA signatures and Rabin–Williams signatures: the state of the art (Report). (additional information at https://cr.yp.to/sigs.html)
^Bernstein, Daniel J. (April 2008). Smart, Nigel (ed.). Proving tight security for Rabin–Williams signatures. Advances in Cryptology – EUROCRYPT 2008. Lecture Notes in Computer Science. Vol. 4965. Istanbul, Turkey: Springer. pp. 70–87. doi:10.1007/978-3-540-78967-3_5. ISBN 978-3-540-78966-6.
^Cite error: The named reference ieee-1363-2000 was invoked but never defined (see the help page).
and 21 Related for: Rabin signature algorithm information
The Digital SignatureAlgorithm (DSA) is a public-key cryptosystem and Federal Information Processing Standard for digital signatures, based on the mathematical...
practice. The Rabin trapdoor function was first published as part of the Rabinsignature scheme in 1978 by Michael O. Rabin. The Rabinsignature scheme was...
ElGamal signature scheme as the predecessor to DSA, and variants Schnorr signature and Pointcheval–Stern signaturealgorithmRabinsignaturealgorithm Pairing-based...
cryptography, the Elliptic Curve Digital SignatureAlgorithm (ECDSA) offers a variant of the Digital SignatureAlgorithm (DSA) which uses elliptic-curve cryptography...
Schnorr signature is a digital signature produced by the Schnorr signaturealgorithm that was described by Claus Schnorr. It is a digital signature scheme...
Diffie–Hellman group. A signature scheme consists of three functions: generate, sign, and verify. Key generation The key generation algorithm selects a random...
traditional digital signatures such as the Digital SignatureAlgorithm or RSA. NIST has approved specific variants of the Merkle signature scheme in 2020....
PGP, and other cryptosystems. The Digital SignatureAlgorithm (DSA) is a variant of the ElGamal signature scheme, which should not be confused with ElGamal...
bit keys Elliptic-curve Diffie–Hellman and Elliptic Curve Digital SignatureAlgorithm with curve P-384 SHA-2 with 384 bits, Diffie–Hellman key exchange...
introduced at ASIACRYPT in 2001. The name, ring signature, comes from the ring-like structure of the signaturealgorithm. Suppose that a set of entities each have...
problem is important for the algorithms used in cryptography such as RSA public-key encryption and the RSA digital signature. Many areas of mathematics...
Science. Rabin's research focuses on cryptography and network security, specifically the design of efficient and secure encryption algorithms. In addition...
cryptographic algorithms the create digital signatures. However, the primary public key signatures currently in use (RSA and Elliptic Curve Signatures) will become...
running-time computational complexity of this algorithm is at least doubly exponential, however, as shown by Fischer & Rabin (1974). The language of Presburger arithmetic...
cryptography, the Double Ratchet Algorithm (previously referred to as the Axolotl Ratchet) is a key management algorithm that was developed by Trevor Perrin...
another, for any attempt will be detectable. In digital signature schemes, there are two algorithms: one for signing, in which a secret key is used to process...
cryptography, a Lamport signature or Lamport one-time signature scheme is a method for constructing a digital signature. Lamport signatures can be built from...
Global Information