IMPROVING THE CRITICAL DENSITY OF THE LAGARIAS-ODLYZKO ATTACK AGAINST SUBSET SUM PROBLEMS

被引:0
|
作者
JOUX, A
STERN, J
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:258 / 264
页数:7
相关论文
共 11 条
  • [1] ON THE LAGARIAS-ODLYZKO ALGORITHM FOR THE SUBSET SUM PROBLEM
    FRIEZE, AM
    SIAM JOURNAL ON COMPUTING, 1986, 15 (02) : 536 - 539
  • [2] SOLVING LOW-DENSITY SUBSET SUM PROBLEMS
    LAGARIAS, JC
    ODLYZKO, AM
    JOURNAL OF THE ACM, 1985, 32 (01) : 229 - 246
  • [3] Solving medium-density subset sum problems in expected polynomial time
    Flaxman, AD
    Przydatek, B
    STACS 2005, PROCEEDINGS, 2005, 3404 : 305 - 314
  • [4] Solving Low-Density Multiple Subset Sum Problems with SVP Oracle
    PAN Yanbin
    ZHANG Feng
    Journal of Systems Science & Complexity, 2016, 29 (01) : 228 - 242
  • [5] Solving low-density multiple subset sum problems with SVP oracle
    Pan Yanbin
    Zhang Feng
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2016, 29 (01) : 228 - 242
  • [6] Solving low-density multiple subset sum problems with SVP oracle
    Yanbin Pan
    Feng Zhang
    Journal of Systems Science and Complexity, 2016, 29 : 228 - 242
  • [7] Improved broadcast attacks against subset sum problems via lattice oracle
    Yu, Yang
    Xiao, Dianyan
    INFORMATION SCIENCES, 2018, 451 : 210 - 222
  • [8] Equivalent key attack against a public-key cryptosystem based on subset sum problem
    Liu, Jiayang
    Bi, Jingguo
    IET INFORMATION SECURITY, 2018, 12 (06) : 498 - 501
  • [9] Equivalent Secret Key Attack against Knapsack PKC based on Subset Sum Decision Problem
    Sakai, Ryuichi
    Murakami, Yasuyuki
    PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), 2018, : 610 - 613
  • [10] Solving medium-density subset sum problems in expected polynomial time: An enumeration approach
    Wan, Changlin
    Shi, Zhongzhi
    FRONTIERS IN ALGORITHMICS, 2008, 5059 : 300 - +