The multiple number field sieve for medium- and high-characteristic finite fields (Q2878838): Difference between revisions

@@ Property / describes a project that uses @@
+SageMath
@@ Property / describes a project that uses: SageMath / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Solving sparse linear equations over finite fields
+Normal rank
@@ Property / cites work @@
+New directions in cryptography
@@ Property / cites work: New directions in cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Pairing the volcano
@@ Property / cites work: Pairing the volcano / rank @@
+Normal rank
@@ Property / cites work @@
+The Number Field Sieve in the Medium Prime Case
@@ Property / cites work: The Number Field Sieve in the Medium Prime Case / rank @@
+Normal rank
@@ Property / cites work @@
+Modifications to the number field sieve
@@ Property / cites work: Modifications to the number field sieve / rank @@
+Normal rank
@@ Property / cites work @@
+Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
+Normal rank
@@ Property / cites work @@
+A one round protocol for tripartite Diffie-Hellman
+Normal rank
@@ Property / cites work @@
+On a problem of Oppenheim concerning ''Factorisatio Numerorum''
+Normal rank
@@ Property / cites work @@
+A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
+Normal rank
@@ Property / cites work @@
+Identity-Based Encryption from the Weil Pairing
@@ Property / cites work: Identity-Based Encryption from the Weil Pairing / rank @@
+Normal rank
@@ Property / cites work @@
+Using number fields   to compute logarithms in finite fields
+Normal rank
@@ Property / cites work @@
+A public key cryptosystem and a signature scheme based on discrete logarithms
+Normal rank
@@ Property / cites work @@
+On asymptotic complexity of computing discrete logarithms over GF(p)
+Normal rank
@@ Property / cites work @@
+Modern Computer Algebra
@@ Property / cites work: Modern Computer Algebra / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1112/s1461157014000369
+Normal rank
@@ Property / OpenAlex ID @@
+W2021384897
@@ Property / OpenAlex ID: W2021384897 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2878838