Pages that link to "Item:Q4286604"

The following pages link to Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm (Q4286604):

Displaying 45 items.

• The space complexity analysis in the general number field sieve integer factorization (Q278727) (← links)
• Practical cryptanalysis of ISO 9796-2 and EMV signatures (Q315558) (← links)
• A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery (Q376164) (← links)
• Reconstructing a phylogenetic level-1 network from quartets (Q486621) (← links)
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
• Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation (Q898244) (← links)
• Distributed matrix-free solution of large sparse linear systems over finite fields (Q1125817) (← links)
• Solving linear equations over GF(2): Block Lanczos algorithm (Q1311312) (← links)
• Efficient matrix preconditioners for black box linear algebra (Q1348088) (← links)
• Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
• Improved algorithms for computing determinants and resultants (Q1763424) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Probabilistic analysis of block Wiedemann for leading invariant factors (Q2048159) (← links)
• The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes (Q2056690) (← links)
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
• Cryptanalysis of the lifted unbalanced oil vinegar signature scheme (Q2102067) (← links)
• Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
• GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\) (Q2304593) (← links)
• A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
• Solving sparse linear systems of equations over finite fields using bit-flipping algorithm (Q2435450) (← links)
• \(\mathbb F _2 \) Lanczos revisited (Q2469540) (← links)
• Fast matrix decomposition in \(\mathbb F_2\) (Q2511223) (← links)
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← links)
• Nearly sparse linear algebra and application to discrete logarithms computations (Q2829802) (← links)
• Sparse Gaussian Elimination Modulo p: An Update (Q2829994) (← links)
• On polynomial selection for the general number field sieve (Q3420245) (← links)
• A double large prime variation for small genus hyperelliptic index calculus (Q3420442) (← links)
• Euclid’s algorithm and the Lanczos method over finite fields (Q4210963) (← links)
• Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
• On the coefficients of the polynomial in the number field sieve (Q5046489) (← links)
• (Q5150596) (← links)
• (Q5150605) (← links)
• A Kilobit Special Number Field Sieve Factorization (Q5387089) (← links)
• Computation of a 768-Bit Prime Field Discrete Logarithm (Q5738876) (← links)
• A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)
• Factoring polynomials over finite fields: A survey (Q5928877) (← links)
• Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow (Q6108987) (← links)
• Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
• IPRainbow (Q6166981) (← links)
• Algebraic algorithm for the alternating trilinear form equivalence problem (Q6550580) (← links)
• Cryptanalysis of \texttt{Elisabeth-4} (Q6595815) (← links)
• The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm (Q6623298) (← links)
• The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)