Infoscience
metadata only
Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An $n^2\log\log n$ Lower Bound for Permanent Circuits with Valid Division#1077496
- Advanced Topics in Cryptography#67379
- Advanced Topics in Cryptography#3686
- Topics in Algebraic Number Theory#67021
- Topics in Algebraic Number Theory#66734
Record · ID 448956
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive