密码分析:最新结果综述

• 作 者: ERNESTF.BRICKELL ANDREWM.ODLYZKO 谯通旭
• 出 处: 通信保密
• 发表日期: 1990年03期
• 关键词: 密码分析 密码体制 签名体制 线性性 计算复杂性 秘密密钥 整数分解 离散对数 密码学 破开

尽管计算复杂性方面有了很大的发展,但检验密码体制的方法仍然是将它交给专家进行密码分析攻击。在刚过去的十年中已公开提出的大部分密码体制已被破开。本文概述一部分已用过的攻击并阐述某些密码分析学家可用的基本工具;讨论了关于背包体制、同余生成器和各种双钥保密及签名体制的攻击。对无已知可行攻击的密码体制,例如,RSA密码体制、离散指数密码体制和DES密码体制,文中也做了简单的讨论。

Despite the tremendous growth in computational complexity, the way to test the cryptosystem is to hand it over to experts for cryptanalysis. Most of the cryptosystems that have been made public in the last decade have been broken. This article outlines some of the attacks that have been used and describes the basic tools available to some cryptanalysts; it discusses attacks on backpacking systems, congruence generators and various double-key secrecy and signature schemes. There is also a brief discussion of cryptosystems that are not known to be viable, such as the RSA cryptosystem, the discrete index cryptosystem, and the DES cryptosystem.