ACGS Algorithm for Hidden Number Problems with Chosen Multipliers

Playback speed

×

Share post

Share post at current time

Share from 0:00

0:00

/

Paid episode

The full episode is only available to paid subscribers of LeetArxiv

ACGS Algorithm for Hidden Number Problems with Chosen Multipliers

Coding the 1988 paper "RSA and Rabin Functions: Certain Parts are as Hard as the Whole" in Python to Understand Alexi-Chor-Goldreich-Schnorr (ACGS) algorithm

Murage Kibicho

Mar 05, 2026

∙ Paid

Quick Summary

This paper introduces the ACGS algorithm for solving Hidden Number Problems with arbitrary multipliers.

*Code blocks render better on Chrome, not in the mobile Substack app.

Abstract for the 1988 paper *RSA and Rabin Functio…*

Listen to this episode with a 7-day free trial

Subscribe to LeetArxiv to listen to this post and get 7 days of free access to the full post archives.

#nojs-banner { position: fixed; bottom: 0; left: 0; padding: 16px 16px 16px 32px; width: 100%; box-sizing: border-box; background: red; color: white; font-family: -apple-system, "Segoe UI", Roboto, Helvetica, Arial, sans-serif, "Apple Color Emoji", "Segoe UI Emoji", "Segoe UI Symbol"; font-size: 13px; line-height: 13px; } #nojs-banner a { color: inherit; text-decoration: underline; } This site requires JavaScript to run correctly. Please turn on JavaScript or unblock scripts