Computation and Application for ID-based Cryptosystems in Mobile Network

• Main Authors: Jing-Shyang Hwu, 胡鈞祥
• Other Authors: Rong-Jaye Chen
• Format: Others
• Language: en_US
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/87555687598296026718

博士 === 國立交通大學 === 資訊工程系所 === 94 === In the next generation mobile telecommunications, any third party that provides wireless data services (e.g., mobile banking) must have its own solution for end-to-end security. Existing mobile security mechanisms are based on public-key cryptosystem. The main concern in a public-key setting is the authenticity of the public key. This issue can be resolved by identity-based (ID-based) cryptography where the public key of a user can be derived from public information that uniquely identifies the user. The first complete and efficient ID-based encryption scheme was proposed by Boneh and Franklin. They use a bilinear map (the Weil pairing) over elliptic curves to construct the encryption/decryption scheme. However, in the existing ID-based cryptosystem, the pairing computing has significant overhead. Therefore, efficient algorithm for computing bilinear pairing is essential for implementation. In this dissertation, we will study the bilinear pairings over elliptic curves and design improved algorithms for the computation of pairing over different finite fields. This will provide efficient implementations for ID-based cryptosystems in mobile devices to construct end-to-end security mechanisms.