A fast encryption method particularly useful for long message lengths is provided. A message m is encrypted using a transmitter secret key z to form a quantity E. A transmitter processor prepares a quadruplet (anew, bnew,snew, E) where:

As in previous embodiments y=gxmodulo p is the public key and x is the receiver secret key. The parameters g, x, and p according to methods known to a person skilled in the art and the parameter g is a generator of the group Gp. The parameter c is a random number. The transmitter processor sends the quadruplet (anew, bnew,snew, E) to a receiver processor. The receiver processor verifies the signature on snew using methods known in the art. The receiver processor then decrypts anew and bnew using the receiver secret key x to get the transmitter secret key z, i.e. in the following manner z=anew/bnewx. The receiver processor uses the transmitter secret key z to decrypt E to get the message M.

 
Web www.patentalert.com

< Circuits and methods for modular exponentiation

< Secure printing over cable network to home printer

> Encryption device using data encryption standard algorithm

> Methods and systems for generating encryption keys using random bit generators

~ 00200