一个53位数的分解

FACTORIZATION OF AN INTEGER WITH 53 DIGITS

摘要: 本文描述一个在序列密码设计中有重要意义的５３位数Ｎ＝的素因子分解。按Ｐｏｍｅｒａｎｃｅ－Ｍｏｎｔｇｏｍｅｒｙ多个多项式二次筛算法编写的Ｐａｓｃａｌ程序在一台ＰＣ３８６微机上把Ｎ分解成三个素数之积。此Ｐａｓｃａｌ程序在一台３８６／４８６微机上分解一个６０位数大约需一天左右的时间。

Abstract: An integer with 53 decimal digits of special significance in stream cipher cryptography was factored on a PC386, using Pomerance-Montgomery’s multiple polynomial quadratic sieve.The Pascal program enables one to factor numbers in the 60-digit range in about a day,using a PC 386/486.