arXiv subjects

Lorenzo Romano

Publications and source records attributed to Lorenzo Romano.

2 recordsLinked to original sources

arXiv2026

RUBICONe: Wireless RAFT-Unified Behaviors for Intervehicular Cooperative Operations and Negotiations

Just as Caesar declared "alea iacta est" (the die is cast) upon crossing the Rubicone river, lane change decisions in autonomous vehicles also represent critical points of no return. RUBICONe addresses this challenge by recognizing that lane change decision-making relying solely on a single vehicle's perception would be as precarious as crossing an unknown river alone. By implementing a distributed consensus framework that extends the RAFT algorithm with wireless connectivity, RUBICONe enables multiple vehicles to collectively process and aggregate their perceptions. Using multiple software-defined radio (SDR) devices as the experimental platform, this study demonstrates how consensus-based decision-making significantly reduces the impact of environmental interference and mitigates the risk of misjudgments by individual vehicles. Just as crossing the Rubicone marked a point of irrevocable action backed by collective intelligence, RUBICONe ensures that lane change decisions are made with comprehensive situational awareness and distributed consensus, showcasing the reliability gain of consensus in wireless communications.

cs.NI↗

arXiv2025

A survey about Hidden Subgroup Problem from a mathematical and cryptographic perspective

We provide a survey on the Hidden Subgroup Problem (HSP), which plays an important role in studying the security of public-key cryptosystems. We first review the abelian case, where Kitaev's algorithm yields an efficient quantum solution to the HSP, recalling how classical problems (such as order finding, integer factorization, and discrete logarithm) can be formulated as abelian HSP instances. We then examine the current state of the art for non-abelian HSP, where no general efficient quantum solution is known, focusing on some relevant groups including dihedral group (connected to the shortest vector problem), symmetric groups (connected to the graph isomorphism problem), and semidirect product constructions (connected, in a special case, to the code equivalence problem). We also describe the main techniques for addressing the HSP in non-abelian cases, namely Fourier sampling and the black-box approach. Throughout the paper, we highlight the mathematical notions required and exploited in this context, providing a cryptography-oriented perspective.

cs.CR↗