Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2007-07-31
2007-07-31
Arani, Taghi T. (Department: 2139)
Cryptography
Particular algorithmic function encoding
C380S029000, C380S030000, C380S044000, C380S045000, C380S282000, C380S285000, C380S286000, C380S263000, C708S492000
Reexamination Certificate
active
10483187
ABSTRACT:
The present invention relates to a method of encryption and decryption comprises the steps of: selecting a generator and a first element of a first non abelian group, respectively, computing a first inner automorphism which is used as a first public key, and generating a second public key by using a secret key being a first integer and the first public key; expressing a plain text by a product of generator of a second non abelian group, computing a second inner automorphism by using an arbitrary second integer and the first public key, computing a third inner automorphism by using the second integer and the second public key, and generating a ciphertext by using the third inner automorphism; and generating a fourth inner automorphism by using the secret key and the second inner automorphism, and decrypting the ciphertext by using the fourth inner automorphism.
REFERENCES:
patent: 5740250 (1998-04-01), Moh
patent: 6038317 (2000-03-01), Magliveras et al.
patent: 6493449 (2002-12-01), Anshel et al.
patent: 7069287 (2006-06-01), Paar et al.
patent: 0 666 664 (1995-08-01), None
T. Moh, “A public Key system With Signature And Master key Functions”, Mathg Department, Purdue university, West lafayette, Indiana, received Apr. 1997.
Anshel et al., “An Algebraic Method for Public—Key Cryptography”, Mathematical Research, Letters 6, 1-5 (1999).
Cooperman et al., “Computing With Matrix Groups using Permutation Representations”, ACM Press, New York, NY, 1995, pp. 259-264.
Vanston et al., “Factorization in the Elementary Abelian p-Group and Their Cryptographic Significance”, Journal of Cryptography (1994) 7: 201-212.
Ko et al., “New Public-Key Cryptosystem Using Braid Groups”, CRYPOTO 2000, LNCS 1880, pp. 166-183, 2000.
Ha Kil Chan
Kim Jae Heon
Paeng Seong Hun
Arani Taghi T.
Electronics and Telecommunications Research Institute
Lowe Hauptman & Berber LLP
LandOfFree
Public key cryptosystem using finite non abelian groups does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Public key cryptosystem using finite non abelian groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Public key cryptosystem using finite non abelian groups will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3768180