基于ECDLP的背包公钥密码体制  

A Knapsack Public-key Cryptosystem Based On Elliptic Curve Discrete Logarithm Problem

作　　者：罗坤杰[1] 罗文俊[1] 

机构地区：[1]贵州大学计算机软件与理论研究所,贵州贵阳550025

出　　处：《信息安全与通信保密》2008年第7期83-85,共3页Information Security and Communications Privacy

基　　金：贵州省省长基金(项目编号:2005-368);贵州大学校内项目(项目编号:2006-504)

摘　　要：基于背包问题的密码体制是NP完全问题[1],有较快的加/解密速度和能满足广泛应用的密码系统。背包系统问题仍然保持较热的研究方向这是毫无疑问的。给定点对(P,[m]P),求整数m,是一个非常困难的问题,这问题称为椭圆曲线离散对数问题(简称为ECDLP)。论文提出基于椭圆曲线离散对数问题的一种新颖的背包类型公钥密码体制。There is no problem that the knapsack systems should be continuous studied, and NP-completeness nature, the faster speed ofencryption, this knapsack-based crypto system can still meet the wide requirement of applications. It is very difficult to find an integer m such that[m]p = Q, and this question is called the elliptic discrete separate logarithm question（simple form is ECDLP）. This paper presents a new knapsack-type public key cryptosystem based on a novel application of the elliptic curve logarithm problem.

关 键 词：背包密码 NP完全问题 公钥密码体制 ECDLP 

分 类 号：TN918.1[电子电信—通信与信息系统]