[nullhaven]
All challenges
Crypto★★★★★400 pts

Three encrypted postcards

Godmode · 1d ago · 1 solved

The same short message was sent to three different recipients. The implementation used textbook RSA with e = 3 and no padding, which is fine as long as the message is never repeated.

It was repeated.
python
n1 = 36041051696549707225961012523199836945726799707798909662006782396841878396261403661206440037341887147568669438335547
c1 = 30043037911416152796365183838339057628842166846302980476150864272773969449734740868266158501238689612108527168797931

n2 = 32489501793701046510660486346661328267803681770925384178546164480971291416340531226488236116149802256301118981926273
c2 = 21233374127272071386288279435598176636964269135280663864677462162268925102839829492698009070450639168549672687415615

n3 = 26296943225550021328786931780417829993668648095748235443620621411777535449503715586984513086469214141146584924150159
c3 = 20945865379255010230829764564436359296286391328747945859314556507458950089879209534170376562302834134341383417868366

Each ci = m³ mod ni. Because m³ is smaller than n1·n2·n3, there is exactly one number below that product which satisfies all three congruences — and that number is m³, not a wrapped value.

Solve the system, take the cube root, read the bytes.

Submitting a flag needs an account

That's what records your points and lets you claim the first blood under your name.

Free, no e-mail verification. You land back on this challenge.

Solved by · 1

  1. 1
    JE
    Jetboy01 First blood1d ago