We study reversible secp256k1 point-addition circuits developed through ECDSA.Fail for Shor's elliptic-curve discrete-logarithm algorithm. Two complementary constructions improve record-and-replay GCD arithmetic: Jump-2 groups binary-GCD steps and compresses their decisions using base-5 encoding, while ping-pong uses f...
Jie-Yi Long, Theodore Pender, Zhao-Feng Huang et al.· 1 citation
We introduce SemiBase, a project that computes and formally certifies finite identity bases for small semigroups. Deciding finite basability is undecidable for finite algebras and remains open for finite semigroups. The task requires a proof that a candidate basis is complete, or a proof that none exists, rather than a...
João Araújo, Jan Hůla, Mikoláš Janota et al.· 0 citations
The public record shows AI agents complementing human judgment, providing evidence for open autoresearch on efficiently evaluable, machine-checkable objectives.
An autonomous cryptanalysis workflow in which agents generate, test, and refine hypotheses before human review is presented, in which reproducible candidates with exact witnesses, controls, code, and run records are returned.
This work investigates prompt echoing small language models from different families and shows that echoing prompts are likely to have partial overlap with the training dataset but the phenomenon is primarily driven by the model's induction heads.
Inez Okulska, B. Naskrȩcki, Jan Piotrowski et al.· 0 citations
It is shown that the CRT-FHE scheme of Pradhan et al. is insecure for laws within its assumed error distribution range, and that the transformation from ordinary Ring-LWE to CRT-RLWE does not preserve the error distribution, so it does not establish that CRT-RLWE is at least as hard as Ring-LWE.
Lukasz Olejnik, B. Naskrȩcki· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
