In view of Shoup’s Theorem 19.2, methods that have lower time complexity than the methods explained in Chapter 19 cannot be generic. This applies not only to subexponential time methods, but also to methods whose complexity is still exponential and of the form O(|G|C) with C < 1/2.
|Title of host publication||Handbook of Elliptic and Hyperelliptic Curve Cryptography|
|Number of pages||15|
|ISBN (Print)||1584885181, 9781584885184|
|State||Published - 1 Jan 2005|
Bibliographical notePublisher Copyright:
© 2006 Taylor & Francis Group, LLC.
ASJC Scopus subject areas
- Mathematics (all)
- Computer Science (all)