Algorithms for Black-Box Fields and their Application to Cryptography
- 1 January 1996
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 283-297
- https://doi.org/10.1007/3-540-68697-5_22
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete LogarithmsPublished by Springer Nature ,2001
- Secure circuit evaluationJournal of Cryptology, 1990
- The number field sievePublished by Association for Computing Machinery (ACM) ,1990
- A key-exchange system based on imaginary quadratic fieldsJournal of Cryptology, 1988
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- Elliptic Curve CryptosystemsMathematics of Computation, 1987
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- On the number of positive integers ≤ x and free of prime factors > y, IIIndagationes Mathematicae, 1966
- On the Distribution of Quadratic Residues (mod p )Journal of the London Mathematical Society, 1933