A course in computational algebraic number theory
A course in computational algebraic number theory
Algorithmic number theory
Proper parametrization of surfaces with a rational pencil
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Security Analysis of the PACE Key-Agreement Protocol
ISC '09 Proceedings of the 12th International Conference on Information Security
Efficient indifferentiable hashing into ordinary elliptic curves
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Estimating the size of the image of deterministic hash functions to elliptic curves
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Password based key exchange protocols on elliptic curves which conceal the public parameters
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Deterministic encoding and hashing to odd hyperelliptic curves
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
The geometry of flex tangents to a cubic curve and its parameterizations
Journal of Symbolic Computation
Verified indifferentiable hashing into elliptic curves
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Insider attacks and privacy of RFID protocols
EuroPKI'11 Proceedings of the 8th European conference on Public Key Infrastructures, Services, and Applications
Indifferentiable hashing to barreto---naehrig curves
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Elligator: elliptic-curve points indistinguishable from uniform random strings
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Verified indifferentiable hashing into elliptic curves
Journal of Computer Security - Security and Trust Principles
| Hi-index | 0.00 |
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the curve. For this, we reduce the problem to the task of finding a rational point on a curve of genus zero.