The Computer Journal

Journal: The Computer Journal

Abbreviation

Comput. J.

Publisher

Oxford University Press

ISSN

0010-4620
1460-2067

Show all metadata

Search Results

Publications 1 - 8 of 8

Degeneracy in Geometric Computation and the Perturbation Approach
Schorn, P. (1994)
The Computer Journal
System Design for the Remote Execution of Library Routines
Teufel, B. (1987)
The Computer Journal
Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects
Nievergelt, J.; Widmayer, P. (1993)
The Computer Journal
A Time-Aware Recommender System Based on Dependency Network of Items
Daneshmand, Hadi; Javari, Amin; Abtahi, Seyed E.; et al. (2015)
The Computer Journal
Covering pairs in directed acyclic graphs
Beerenwinkel, Niko; Beretta, Stefano; Bonizzoni, Paola; et al. (2015)
The Computer Journal
Double syntax oriented processing
Alpiar, R. (1971)
The Computer Journal
Review: Perspectives on Web Services—Applying SOAP, WSDL and UDDIto Real-World Projects
Alonso, Gustavo (2004)
The Computer Journal
Failing to Hash Into Supersingular Isogeny Graphs
Booher, Jeremy; Bowden, Ross; Doliskani, Javad; et al. (2024)
The Computer Journal
An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of 'hard supersingular curves' that is equations for supersingular curves for which computing the endomorphism ring is as difficult as it is for random supersingular curves. A related open problem is to produce a hash function to the vertices of the supersingular $\ell $ -isogeny graph, which does not reveal the endomorphism ring, or a path to a curve of known endomorphism ring. Such a hash function would open up interesting cryptographic applications. In this paper, we document a number of (thus far) failed attempts to solve this problem, in the hope that we may spur further research, and shed light on the challenges and obstacles to this endeavour. The mathematical approaches contained in this article include: (i) iterative root-finding for the supersingular polynomial; (ii) gcd's of specialized modular polynomials; (iii) using division polynomials to create small systems of equations; (iv) taking random walks in the isogeny graph of abelian surfaces, and applying Kummer surfaces and (v) using quantum random walks.

Publications 1 - 8 of 8

Journal: The Computer Journal

Abbreviation

Publisher

Journal Volumes

ISSN

Description

Filters

Search Results