Pages that link to "Item:Q5387089"
From MaRDI portal
The following pages link to A Kilobit Special Number Field Sieve Factorization (Q5387089):
Displaying 10 items.
- Computational hardness of IFP and ECDLP (Q505664) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← links)
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600) (← links)
- ECM on Graphics Cards (Q3627453) (← links)
- Faster Multiplication in GF(2)[x] (Q5387595) (← links)
- Predicting the Sieving Effort for the Number Field Sieve (Q5387597) (← links)
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree (Q5738795) (← links)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)
