DocumentCode
510190
Title
A Note on Twin Diffie-Hellman Problem
Author
Wang, Mingqiang ; Li, Leibo
Author_Institution
Sch. of Math., Shandong Univ. Jinan, Jinan, China
Volume
1
fYear
2009
fDate
11-14 Dec. 2009
Firstpage
451
Lastpage
454
Abstract
Recently Cash, Kiltz and Shoup [5] proposed a new computational problem called twin Diffie-Hellman problem. This paper investigates properties of the trapdoor test introduced in [5]. Secondly this paper presents some new relations between the twin Diffie-Hellman problem and the Diffie-Hellman problem.
Keywords
computational complexity; cryptography; computational problem; cryptographic constructions; hard problem; trapdoor test; twin Diffie-Hellman problem; Access protocols; Computational intelligence; Cryptography; DH-HEMTs; Heart; Mathematics; Quantum well devices; Security; Testing; Twin D7H problem; decision; trap door test;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security, 2009. CIS '09. International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-5411-2
Type
conf
DOI
10.1109/CIS.2009.160
Filename
5376477
Link To Document