Skip to content

Request for a writeup - CTF HXP 2019 - nacht #1

@IamLupo

Description

@IamLupo

Hello sir,

Could you make a writeup about the "nacht" CTF? I saw you solved it at "2019-12-29 18:00". Congrats

I manage get myself to get the X, A, R, S.

But my problem was getting the C1 and C2 in the formula:

X + S mod 2^128 = A
(C1 * R) + (C2 * R * R) mod (2^130 - 5) = X

I Re-arrange the formula:

R(C1 + C2 * R) = R * Y
R * Y * X mod (2^130 - 5) = 1

Then us modulo multiple inverse to find Y. But the Y i found is not the correct one.

If i could find the corrrect Y for two tag (A) cases i could find C1 and C2:

C2 = abs(Y1 - Y2) / abs(R1 - R2)
C1 = Y1 - (C2 * R1)

Happy 2020!

CTF: https://2019.ctf.link/internal/challenge/5af3da6e-8187-43cf-bd40-5f553e1a7a58

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions