搜索结果: 1-15 共查到“军队指挥学 Factorization”相关记录19条 . 查询时间(0.056 秒)
On Improving Integer Factorization and Discrete Logarithm Computation using Partial Triangulation
RSA factoring discrete logarithm problem
2017/8/8
The number field sieve is the best-known algorithm for factoring integers and solving the discrete logarithm problem in prime fields. In this paper, we present some new improvements to various steps o...
Bones et al. showed at Crypto 99 that moduli of the form N=prq can be factored in polynomial time when r≥logp. Their algorithm is based on Coppersmith's technique for finding small roots of polynomial...
Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption
homomorphic encryption matrix factorization gradient descent
2016/3/4
Recommendation systems become popular in our daily life. It is well known that the more
the release of users’ personal data, the better the quality of recommendation. However, such
services raise se...
FFS Factory: Adapting Coppersmith's "Factorization Factory" to the Function Field Sieve
Discrete logarithm Function field sieve Cryptanalysis
2016/1/9
In 1993, Coppersmith introduced the “factorization factory”
approach as a means to speed up the Number Field Sieve algorithm
(NFS) when factoring batches of integers of similar size: at the expense
...
Mersenne factorization factory
Mersenne numbers factorization factory special number field sieve
2016/1/7
We present new factors of seventeen Mersenne numbers, obtained using a variant of
the special number field sieve where sieving on the algebraic side is shared among the numbers.
It reduced the overa...
A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
public-key cryptography / factoring
2016/1/6
Given two integers N1=p1q1 and N2=p2q2 with α-bit primes q1,q2, suppose that the t least significant bits of p1 and p2 are equal. May and Ritzenhofen (PKC 2009) developed a factoring algorithm for N1,...
New Efficient Identity-Based Encryption From Factorization
Identity-based encryption without pairings without lattices
2014/3/10
Identity Based Encryption (IBE) systems are often constructed using pairings or lattices. Three exceptions are due to Cocks in 2001, Boneh, Gentry and Hamburg in 2007, and Paterson and Srinivasan in 2...
A non-Abelian factorization problem and an associated cryptosystem
public-key cryptography / Non-abelian Groups Braid Groups GL$_n({{\mathbb{F}}_q})$ UT$_n({{\mathbb{F}}_q})$
2012/3/29
In this note, we define a cryptosystem based on non-commutative properties of groups. The cryptosystem is based on the hardness of the problem of factoring over these groups. This problem, interesting...
A non-Abelian factorization problem and an associated cryptosystem
Cryptography Discrete logarithm problem Die-Hellman key exchange
2011/2/23
In this note, we define a cryptosystem based on non-commutative properties of groups. The cryptosystem is based on the hardness of the problem of factoring over these groups. This problem, interesting...
Factorization of RSA-180
RSA factoring
2010/7/13
We present a brief report on the factorization of RSA-180, currently smallest unfactored RSA number. We show that the numbers of similar size could be factored in a reasonable time at home using open ...
This paper reports on the factorization of the 768-bit number RSA-768 by the number
field sieve factoring method and discusses some implications for RSA.
Approximate Integer Common Divisor Problem relates to Implicit Factorization
Greatest Common Divisor Factorization Integer Approximations
2009/12/29
In CaLC 2001, Howgrave-Graham presented a technique to calculate GCD (Greatest Common
Divisor) of two large integers when the integers are not exactly known, but some approximation
of those integers...
The Fermat factorization method revisited
Fermat factorization method bivariate integer polynomial equation Coppersmith’s methods
2009/7/14
We consider the well known Fermat factorization method, we call
the Fermat factorization equation the equation solved by it: P(x, y) =
(x + 2R)2 − y2 − 4N = 0; where N = p q > 0 is a RSA...
The elliptic curve method (ECM) is one of the best factorization
methods available. It is possible to use hyperelliptic curves instead of elliptic
curves but it is in theory slower. We use special h...
On the Complexity of Integer Factorization
Integer Factorization irreducible polynomials integer factorization algorithm
2009/6/12
This note presents a deterministic integer factorization algorithm based on a system of polynomials
equations. This technique exploits a new idea in the construction of irreducible polynomials with p...