No Divide Just Conquer 2/3

hardware VM RSA FCSC 2025 solved on

star star

Description

As a reminder, the RSA system is an asymmetric cryptography mechanism based on the problem of factoring large integers. For a public exponent e and a size t in bits, two prime numbers p and q are generated such that p - 1 and q - 1 are coprime with e. The product p * q of t bits defines the public modulus N, then d is computed as the modular inverse of e modulo phi(N) = (p - 1) * (q - 1).

To compute a modular inverse, the extended Euclidean algorithm is often used. However, it is difficult to protect this algorithm against physical attacks.

The goal is to perform RSA key generation without using the Euclidean algorithm.

This challenge is one of a series of three that we strongly advise you to solve in order:

The documentation of the virtual machine is available on this page.


The objective is the same as in the first challenge: to produce code that generates RSA keys. However, in this second challenge, access to certain instructions in the virtual machine is restricted to prevent the use of the Euclidean algorithm.

Files

Author

Neige

Challenge Instructions

  1. First, download docker-compose.yml:
    curl https://hackropole.fr/challenges/fcsc2025-hardware-no-divide-just-conquer/docker-compose.public.yml -o docker-compose.yml
  2. Launch the challenge by executing in the same folder:
    docker compose up
  3. Then, in another console, access the challenge with Netcat:
    nc localhost 4000
⚠️ Important: You must solve the challenge by interacting with the Docker container through the exposed network port. Any other way is not considered valid.

In case you encounter problems, please consult the FAQ.

Flag

Share my success on Fediverse, Twitter, Linkedin, Facebook, or via email.

Submit your solution

You can submit your writeup for this challenge. Read the FAQ to learn how to proceed.

You need to be logged in to submit a writeup.

Writeups

I've been looking for a long time and I still can't find the flag!

You can vote for the solutions you prefer by using the on their respective pages.

DateAuthor Language Tags
2025-04-28
n3ige86
πŸ‡«πŸ‡·
author