| Summary: | 碩士 === 國防大學管理學院 === 資訊管理學系 === 97 === As the computer communication thrives today, its security becomes a hot issue. The cryptosystem is to achieve the goal that only the legal recipient can decode what sender want him to uncover but illegal user can’t get one word. Since 1970, there were many cryptosystems proposed. However, most of them are proved unsecur. A good cryptosystem should not only have security but also it’s performance. Nowadays the security of public key cryptosystem was based on factorization or discrete logarithm problem. These kinds of systems increase system’s key length to ensure the safety of their system. By increasing the key length, the efficiency becomes lower. Thus, as a result, choosing efficiency or security becomes a dilemma. Due to the increase in computing speed, these mathematics’ assumptions may be ruined in the future. This study combines knapsack and the elliptic curve logarithm problem to develop new type of cryptosystem. Our schemes offer dual security assumptions, off-line ID-Based authentication, and avalanche effects.
|
|---|
