Carding 4 Carders
Professional
- Messages
- 2,724
- Reaction score
- 1,588
- Points
- 113
The ambitious project was conceived by San Diego-based MemComputing, which is exploring the possibility of using ASICs (Application Specific Integrated Circuits) to crack 2048-bit RSA encryption in real time.
The theory of MemComputing specialists is that if you combine processing and data in memory, you can overcome the so-called "von Neumann bottleneck" (limiting the bandwidth of data exchange between the processor and memory compared to the amount of memory).
In turn, practice shows that with increasing computational complexity, the processing time required by classical computers increases, and exponentially complex mathematical problems cannot be solved by classical computers in an acceptable time frame.
Actually, while the world is waiting for quantum computers, MemComputing decided to find out how long it will take to crack RSA using its patented in-memory processing, and whether it can be done in a shorter time.
It's more like a wash contract, because the basic research was initiated by the US Air Force.
In the aggregate of the research and development done, the forecast for ASICs showed the possibility of solving the problem of 2048-bit factorization in tens of minutes.
Alas, this conclusion is more theoretical than a provable fact, but if all this turns out to be practically feasible, then the terrible crypto-apocalypse and the death of the current encryption will come sooner than we expected.
The theory of MemComputing specialists is that if you combine processing and data in memory, you can overcome the so-called "von Neumann bottleneck" (limiting the bandwidth of data exchange between the processor and memory compared to the amount of memory).
In turn, practice shows that with increasing computational complexity, the processing time required by classical computers increases, and exponentially complex mathematical problems cannot be solved by classical computers in an acceptable time frame.
Actually, while the world is waiting for quantum computers, MemComputing decided to find out how long it will take to crack RSA using its patented in-memory processing, and whether it can be done in a shorter time.
It's more like a wash contract, because the basic research was initiated by the US Air Force.
In the aggregate of the research and development done, the forecast for ASICs showed the possibility of solving the problem of 2048-bit factorization in tens of minutes.
Alas, this conclusion is more theoretical than a provable fact, but if all this turns out to be practically feasible, then the terrible crypto-apocalypse and the death of the current encryption will come sooner than we expected.
