FlagThis

Abstract

This research demonstrates the successful factorization of the RSA-250 modulus (an 829-bit integer) using the General Number Field Sieve (GNFS) algorithm. By leveraging the CADO-NFS open-source software and the computational power of the PRACE Juwels supercomputer, the authors provide a detailed breakdown of the computational resources and algorithmic steps required to break a modulus of this size, contributing to the ongoing evaluation of RSA key-length security recommendations.