搜索结果: 1-3 共查到“军事学 Integer Factoring”相关记录3条 . 查询时间(0.056 秒)
A Certain Family of Subgroups of Zn⋆ Is Weakly Pseudo-Free under the General Integer Factoring Intractability Assumption
families of computational groups weak pseudo-freeness abelian groups
2017/11/28
A Certain Family of Subgroups of Zn⋆ Is Weakly Pseudo-Free under the General Integer Factoring Intractability Assumption.
This article appeared as Chapter 5 of the book "Topics in Computational Number Theory inspired by Peter L. Montgomery", edited by Joppe W. Bos and Arjen K. Lenstra and published by Cambridge Universit...
Use of SIMD-Based Data Parallelism to Speed up Sieving in Integer-Factoring Algorithms
Integer Factorization Sieving Multiple-Polynomial Quadratic Sieve Method
2016/1/4
Many cryptographic protocols derive their security from the apparent
computational intractability of the integer factorization problem. Currently,
the best known integer-factoring algorithms run in ...