DocumentCode :
2000410
Title :
An implementation of public key cryptosystem TTM with linear time complexity for decryption
Author :
Hu, Yuh-Hua ; Wang, Lih-Chung ; Chen, Jiun-Ming ; Lai, Feipei ; Cho, Chun-Yen
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fYear :
2003
fDate :
29 June-4 July 2003
Firstpage :
17
Abstract :
T. Moh invented a cryptosystem called tame transformation method (TTM). TTM cryptosystem is claimed to be the fastest among all currently known unbroken public key cryptosystems. We have done an actual implementation with linear time complexity for decryption and made some performance tests on it to verify the claim of speed. Also, we give some discussion on our TTM implementation and some attacks on TTM.
Keywords :
computational complexity; public key cryptography; decryption; linear time complexity; public key cryptosystem; tame transformation method; Abstract algebra; Computer science; Elliptic curve cryptography; Mathematics; Polynomials; Postal services; Public key cryptography; Testing; Time to market; Zinc;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
Type :
conf
DOI :
10.1109/ISIT.2003.1228031
Filename :
1228031
Link To Document :
بازگشت