Better path-finding algorithms in LPS Ramanujan graphs-Reference-Cited by-同舟云学术

Better path-finding algorithms in LPS Ramanujan graphs

Published:2018-12-01 Issue:4 Volume:12 Page:191-202
ISSN:1862-2976
Container-title:Journal of Mathematical Cryptology
language:
Short-container-title:

Author:

Carvalho Pinto Eduardo,Petit Christophe^ORCID

Abstract

Abstract We provide a new heuristic polynomial time algorithm that computes short paths between arbitrary pairs of vertices in Lubotzky–Philipps–Sarnak’s Ramanujan graphs. The paths returned by our algorithm are shorter by a factor approximately 16/7 compared to previous work, and they are close to optimal for vertices corresponding to diagonal matrices. Our results also lead to an improved cryptanalysis of the Charles–Goren–Lauter hash function.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Computational Mathematics,Computer Science Applications

Link

https://www.degruyter.com/document/doi/10.1515/jmc-2017-0051/pdf

Reference32 articles.

1. Full cryptanalysis of LPS and Morgenstern hash functions;Security and Cryptography for Networks—SCN 2008,2008

2. The least prime number represented by a binary quadratic form;Preprint,2018

3. Su di un metodo per la risoluzione in numeri interi dell’ equazione ∑h=0nch⁢xn-h⁢yh=p{\sum_{h=0}^{n}c_{h}x^{n-h}y^{h}=p};Giornale Mat. Battaglini,1903

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Revisiting the Algorithms for the Quaternion $$\ell $$-Isogeny Path Problems;Communications in Computer and Information Science;2024

2. Shorter quantum circuits via single-qubit gate approximation;Quantum;2023-12-18

3. Ramanujan graphs and the spectral gap of supercomputing topologies;The Journal of Supercomputing;2020-05-10