We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Pairings can be used for attacking the discrete logarithm on supersingular curves as you propose, it’s used for encryption or signature purposes. https://pdfupload.io/docs/8453308d#%5B%7B%22num%22%3A2790%2C%22gen%22%3A0%7D%2C%7B%22name%22%3A%22FitH%22%7D%2C343%5D shows how certain type of pairings can be inverted in subexponential time.
I’m also interested in the case where exponention inversion is already done (so just miller inversion).
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Pairings can be used for attacking the discrete logarithm on supersingular curves as you propose, it’s
used for encryption or signature purposes.
https://pdfupload.io/docs/8453308d#%5B%7B%22num%22%3A2790%2C%22gen%22%3A0%7D%2C%7B%22name%22%3A%22FitH%22%7D%2C343%5D shows how certain type of pairings can be inverted in subexponential time.
I’m also interested in the case where exponention inversion is already done (so just miller inversion).
The text was updated successfully, but these errors were encountered: