Blinding RSA - Maple Application Center

Blinding RSA

Author
: Martin Monerjan
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
In this worksheet we look at how to get a valid signature on a message the owner of the key-pair (Bob) was not willing to sign. Imagine the following: Marvin (evil) wants Bob (good) to sign a message M. Bob refuses. Now Marvin picks a random Number r and computes an incospicuous Message M'=r^e*M mod N , N being the RSA-Modulus and e Bob's public key. He then asks Bob to sign the Message which he does. Thus Marvin receives the signature S' of M'. Recalling that S'=(M')^d mod N he can now simply compute S=S'/r mod N and yield the valid signature of M. Since we don't use a one-way-hash (MD5, SHA-1) but the simple S=M^d mod N here this is far from being a real threat to RSA

Application Details

Publish Date: October 10, 2001
Created In: Maple 6
Language: English

More Like This

The Advanced Encryption Standard and its modes of operation
Frequency Analysis and the Kama Sutra Substitution Cipher
The SHA-3 Family of Cryptographic Hash Functions and Extendable-Output Functions
RSA with maple
Secure Symmetric-Key Block Cipher Based on Generalized Finite Fields
Elliptic Curve Cryptography
User-Friendly ElGamal Public-Key Encryption Scheme
Elliptic Curve Arithmetic over the Real Numbers
Exploring the Modified IDEA Using the topicIDEA Package
A Symmetric-Key Block Cipher Generating Cryptograms Containing Characters Belonging to the Definite Set
Mersenne Primes-Based Symmetric-Key Masquerade Block Cipher