搜索结果: 1-7 共查到“军事学 Coppersmith”相关记录7条 . 查询时间(0.048 秒)
Coppersmith's lattices and ``focus groups'': an attack on small-exponent RSA
lattice techniques RSA cryptanalysis
font style='font-size:12px;'>
2017/9/1
We present a principled technique for reducing the matrix size in some applications of Coppersmith's lattice method for finding roots of modular polynomial equations. It relies on an analysis of the a...
Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials
Coppersmith's method lattices polynomial congruences
font style='font-size:12px;'>
2016/12/9
We draw a new connection between Coppersmith's method for finding small solutions to polynomial congruences modulo integers and the capacity theory of adelic subsets of algebraic curves. Coppersmith's...
Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness
Coppersmith Methods Analytic Combinatorics Cryptanalysis
font style='font-size:12px;'>
2016/1/27
The Coppersmith methods is a family of lattice-based techniques to find small integer
roots of polynomial equations. They have found numerous applications in cryptanalysis and, in recent
development...
FFS Factory: Adapting Coppersmith's "Factorization Factory" to the Function Field Sieve
Discrete logarithm Function field sieve Cryptanalysis
font style='font-size:12px;'>
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
...
A Variant of Coppersmith's Algorithm with Improved Complexity and Efficient Exhaustive Search
Coppersmith's Method LLL
font style='font-size:12px;'>
2014/3/11
Coppersmith described at Eurocrypt 96 a polynomial-time algorithm for finding small roots of univariate modular equations, based on lattice reduction. In this paper we describe the first improvement o...
Factoring RSA keys from certified smart cards: Coppersmith in the wild
factorization Coppersmith
font style='font-size:12px;'>
2014/3/7
An attacker can efficiently factor at least 184 distinct 1024-bit RSA keys from Taiwan's national "Citizen Digital Certificate" database. The big story here is that these keys were generated by govern...
A New Human Identification Protocol and Coppersmith's Baby-Step Giant-Step Algorithm
Human Computer Cryptography Human Identification Protocols Entity Authenticaion
font style='font-size:12px;'>
2010/7/13
We propose a new protocol providing cryptographically secure authentication to unaided humans against passive adversaries. We also propose a new generic passive attack on human identification protocol...