Fixed-parameter complexity and cryptography
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 121-131
- https://doi.org/10.1007/3-540-56686-4_38
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fixed-parameter intractabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Self-witnessing polynomial-time complexity and prime factorizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- CM-Curves with Good Cryptographic PropertiesPublished by Springer Nature ,2001
- Discrete logarithms in finite fields and their cryptographic significancePublished by Springer Nature ,2000
- Discrete Logarithms in $GF ( P )$ Using the Number Field SieveSIAM Journal on Discrete Mathematics, 1993
- A rigorous time bound for factoring integersJournal of the American Mathematical Society, 1992
- An implementation for a fast public-key cryptosystemJournal of Cryptology, 1991
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- Fast, Rigorous Factorization and Discrete Logarithm AlgorithmsPublished by Elsevier ,1987
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983