Practical cryptanalysis with MiniMax's latest Internal Model

cryptography

Our research team used an internal-only research model that we will call MiniMax's Internal Model (MIM) to conduct automated cryptanalysis across modern cryptographic schemes. The model identified several previously unknown structural flaws and turned multiple theoretical attacks into practical breaks.

Our results cover three main areas: First, across historical NIST cryptographic standardization competitions, MIM produced the first practical breaks against multiple candidate algorithms that previously had no known practical attacks. Second, we extended our scope to recent papers from leading cryptography conferences and journals, as well as competition-winning designs, achieving efficient authenticated ciphertext forgery or key recovery on several peer-reviewed constructions and extending the highest number of attacked rounds on a recent block cipher. Third, in tackling classical hard mathematical problems that underlie public-key cryptography, MIM combined algebraic structure exploitation with systems-level engineering optimizations to solve dozens of previously unsolved high-order instances in public cryptographic challenges, achieving measured speedups of hundreds to tens of thousands of times over prior state-of-the-art solvers.


Why cryptanalysis

Cryptography secures network communications, financial transactions, and critical infrastructure. Unlike software vulnerability research, which looks for implementation bugs in coding, cryptanalysis targets the design itself, examining primitives, protocols, and hardness assumptions for flaws. Modern cryptanalysis tests both mathematical reasoning and code, with clear, verifiable outcomes. On-paper derivations and complexity estimates aren't enough: a model has to turn its analysis into executable code that carries out the attack within strict data and compute budgets. A single flaw in either the mathematical derivation or the code causes the entire attack to fail. The script either recovers the target secret or it does not, leaving zero room for hallucination. This binary outcome makes cryptanalysis a clean testbed for long-horizon reasoning and scientific discovery in language models.


1. Breaking NIST candidates with no known practical attacks

Testing language models on cryptanalysis requires separating reasoning from memorized papers. CryptanalysisBench (NeurIPS 2026), created by researchers from ETH Zurich, Anthropic, and collaborators, collects entries from four NIST standardization competitions: AES, SHA-3, lightweight cryptography, and post-quantum cryptography. Tier 1 contains 49 schemes with known practical attacks. Tier 2 contains 135 publicly reviewed schemes with no known practical attacks, along with 7 production-strength challenge schemes.

Using the same setup as the original paper, we evaluated MIM on Tier 2. Its independent reasoning traces show that it can directly analyze the underlying mathematics and compromise several NIST candidates. Examples include:

MIM also found and exploited more than a dozen unreported implementation bugs in Tier 2 reference code:


2. New attacks on peer-reviewed schemes and competition winners

Most schemes in CryptanalysisBench Tier 2 were unstandardized candidates from past competitions. To test whether schemes published at major cryptography venues, or even competition winners, still contain flaws missed during human expert review, we built an automated cryptanalysis framework to evaluate both. These schemes use security proofs and evaluate resistance against standard differential, linear, and algebraic attacks. MIM still found gaps in their proofs and edge cases in their designs, turning them into working attacks in the standard security model:


3. Faster solvers for classic hard problems in public-key cryptography

We also tested whether the model can build faster solvers when a scheme has no design flaws and relies on classic hard problems. Public-key and post-quantum cryptography rely on code-based, lattice-based, and multivariate problems. To measure their concrete hardness, the research community maintains public challenge benchmarks that guide parameter choices for NIST post-quantum standards.

On these benchmarks, MIM combined mathematical simplification with low-level code optimization for modern processors. By exploiting hidden mathematical structure to shrink the search space, MIM beat records from recent papers and multi-GPU clusters while solving dozens of unbroken instances:


Conclusion

As language models find new attacks on their own, the bottleneck shifts from discovering attacks to verifying and assessing them. Working exploit code shows that an attack succeeds, but evaluating the security margins of cryptographic designs still depends on review by human cryptographers.

This work focuses on academic designs, past competition candidates, and public challenge parameters, and does not affect deployed cryptographic standards.

Following the principles of responsible research and disclosure, we shared our findings with the authors of the respective schemes in advance. We have also curated and validated the reasoning trajectories generated by MIM in the experiments described above, releasing them as technical reports and proof-of-concept code at https://github.com/MiniMax-AI/Research.

We welcome cryptography and security researchers and developers to test and use MIM and explore the capabilities and limits of automated cryptanalysis with us. To apply for testing access, please send a brief introduction and a summary of your research background to developer@minimax.io. We will provide access to qualified researchers and developers.