Scheme for fast realization of encryption, decryption and...

H - Electricity – 04 – L

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

H04L 9/30 (2006.01) G11B 23/00 (2006.01) H04L 9/32 (2006.01)

Patent

CA 2267721

A new scheme for fast realization of encryption, decryption and authentication which can overcome the problems of the RSA cryptosystem is disclosed. The encryption obtains a ciphertext C from a plaintext M according to C ~ M e (mod n) using a first secret key given by N (~ 2) prime numbers p1, p2, ~, p N, a first public key n given by a product p1 k1p2 k2 ~ p N kN where k1, k2, ~, kN are arbitrary positive integers, a second public key a and a second secret key d which satisfy ed ~ 1 (mod L) where L is a least common multiple of p1-1, p2-1, ~, pN-1. The decryption recovers the plaintext M by obtaining residues M p1k1, M p2k2, ~, M pNkN modulo p1k1, p2k2, ~, p NkN, respectively, of the plaintext M using a prescribed loop calculation with respect to the first secret key p1, p2, ~, p N, and by applying the Chinese remainder theorem to the residues M p1k1, M p2k2, ~, M pNkN. This encryption/decryption scheme can be utilized for realizing the authentication.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Scheme for fast realization of encryption, decryption and... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Scheme for fast realization of encryption, decryption and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheme for fast realization of encryption, decryption and... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1893784

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.