← Back to challenges

Triple Threat

Cryptography HARD NORMAL 499 pts
Most RSA writeups online assume n = p * q.
Most. Not all.
This one's a little greedier.
n = 672807094328387965901311687243850472614628750693249602286236660618843842265777646238191361974536348339252839846544510857895424477008232471196811161832946898995214211298106772826568593937666345164593638993641857113756182590739123438652490851627576472938659131591502813104057098474501329546841541235334073785026551723486383266545723413753969196539606645972082264784349795748135297704878420020584701318240040022457962280807258811068654101274706648322021377827114803
e = 65537
c = 388598230819597785978945216970339481866028608365254639544512066958047999608970151845277003546694902262294991830538587520831911993335491326526019266952511420762765351587201597653227224657362426172078002303156201748361773078977378306911978195067778189350483895330451918634017168985856766827451397157224847975774259380164282602182529039495921683276226329777286903010793861646897706286430745538977161133839807419072537165193306497551784465128041375762379549345647451
how does φ(n) work when n is a product of more than two primes?
Alphwarde SUPERVISOR

No writeups submitted.

3bada (SL1GHTLY_CL0SE) 2026-05-07 11:33:25