A KNAPSACK-TYPE PUBLIC KEY CRYPTOSYSTEM BASED ON ARITHMETIC IN FINITE-FIELDS

被引:119
作者
CHOR, B
RIVEST, RL
机构
[1] AT&T BELL LABS,MURRAY HILL,NJ 07974
[2] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139
关键词
Mathematical Techniques;
D O I
10.1109/18.21214
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A knapsack-type public key cryptosystem is introduced that is the system is based on a novel application of arithmetic in finite fields. By appropriately choosing the parameters, one can control the density of the resulting knapsack, which is the ratio between the number of elements in the knapsack and their size in bits. In particular, the density can be made high enough to foil so-called low-density attacks against the system. At the moment, no attacks capable of breaking the system in a reasonable amount of time are known.
引用
收藏
页码:901 / 909
页数:9
相关论文
共 31 条
[22]   IMPROVED ALGORITHM FOR COMPUTING LOGARITHMS OVER GF(P) AND ITS CRYPTOGRAPHIC SIGNIFICANCE [J].
POHLIG, SC ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (01) :106-110
[23]   PROBABILISTIC ALGORITHMS IN FINITE-FIELDS [J].
RABIN, MO .
SIAM JOURNAL ON COMPUTING, 1980, 9 (02) :273-280
[24]  
RABIN MO, 1979, TR212 MASS INT TECHN
[25]  
RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI 10.1145/357980.358017
[26]  
SCHNORR CP, 1984, HIERARCHY POLYNOMIAL
[27]   A T=O(2N-2), S=O(2N-4) ALGORITHM FOR CERTAIN NP-COMPLETE PROBLEMS [J].
SCHROEPPEL, R ;
SHAMIR, A .
SIAM JOURNAL ON COMPUTING, 1981, 10 (03) :456-464
[28]  
Shamir A., 1982, 23rd Annual Symposium on Foundations of Computer Science, P145, DOI 10.1109/SFCS.1982.5
[29]  
SHAMIR A, 1982, TM230 LAB COMP SCI M
[30]   A MODIFICATION OF THE RSA PUBLIC-KEY ENCRYPTION PROCEDURE [J].
WILLIAMS, HC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (06) :726-729