LeetArxiv

ACGS Algorithm for Hidden Number Problems with Chosen Multipliers (opens in new tab)

Discussed on r/programming, r/programming, and Substack

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

Read the original article
Sign in to keep reading the full article.
Sign UpLog In

Keyboard Shortcuts

Navigation

Next / previous post
j/k
Open post
oorEnter
Preview post
v

Post Actions

Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s

Recommendations

Add interest / feed
Enter
Not interested
x

Go to

Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Discover
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help