The following pages link to (Q3933739):
Displaying 21 items.
- Practical cryptanalysis of ISO 9796-2 and EMV signatures (Q315558) (← links)
- The numerical factorization of polynomials (Q525605) (← links)
- Exact asymptotics of the characteristic polynomial of the symmetric Pascal matrix (Q1003619) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- A non-commutative cryptosystem based on quaternion algebras (Q1671643) (← links)
- \(abc\) triples (Q1745222) (← links)
- Lattice basis reduction for indefinite forms and an application (Q1917523) (← links)
- Attacking ECDSA leaking discrete bits with a more efficient lattice (Q2151304) (← links)
- (Q3754695) (← links)
- Signatures Through Approximate Representations by Quadratic Forms (Q5019323) (← links)
- The Liouville Function and the Riemann Hypothesis (Q5038230) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- Digital collections of examples in mathematical sciences (Q6086393) (← links)
- On computing high-dimensional Riemann theta functions (Q6163181) (← links)
- Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-Based GSW-FHE (Q6488398) (← links)
- Constrained inhomogeneous spherical equations: average-case hardness (Q6601473) (← links)
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks (Q6633578) (← links)
- Formalizing Coppersmith's method in Isabelle/HOL (Q6648162) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
- On the smallest ratio problem of lattice bases (Q6666549) (← links)
- Improved computation of polynomial roots over number fields when using complex embeddings (Q6671812) (← links)
