Nova Publishers
My Account Nova Publishers Shopping Cart
HomeBooksSeriesJournalsReference CollectionseBooksInformationSalesImprintsFor Authors
  Top » Catalog » Journals » Journal of Combinatorics and Number Theory » Volume 1 Issue 3 Articles » My Account  |  Cart Contents  |  Checkout   
Quick Find
Use keywords to find the product you are looking for.
Advanced Search
What's New? more
Central Asia: Perspectives and Present Challenges
Shopping Cart more
0 items
Shipping & Returns
Privacy Notice
Conditions of Use
Contact Us
01.On Even Integers Not of the Form 2k + σ(m) (pp. 263-268)
Notifications more
NotificationsNotify me of updates to Collecting Super Singular Elliptic Curves (pp. 269-273)
Tell A Friend
Tell someone you know about this product.
Collecting Super Singular Elliptic Curves (pp. 269-273) $45.00
Authors:  Reinier Broker
We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over Fq with trace of Frobenius t in case such a curve exists. If GRH holds true, the expected run time of our algorithm is e O((logq)3). We illustrate the algorithm by showing how to construct supersingular curves of prime order. Such curves can readily be used for pairing based cryptography. 

Available Options:
Special Focus Titles
01.Violent Communication and Bullying in Early Childhood Education
02.Cultural Considerations in Intervention with Women and Children Exposed to Intimate Partner Violence
03.Chronic Disease and Disability: The Pediatric Lung
04.Fruit and Vegetable Consumption and Health: New Research
05.Fire and the Sword: Understanding the Impact and Challenge of Organized Islamism. Volume 2

Nova Science Publishers
© Copyright 2004 - 2019

Collecting Super Singular Elliptic Curves (pp. 269-273)