search
cryptography
Trends
- 1Forging 1024-bit RSA signatures in near-SNFS time●Forging 1024-bit RSA signatures in nearly SNFS time [pdf]
A new cryptography paper describes a method for forging 1024-bit RSA signatures in time close to that of the Special Number Field Sieve, the fastest known factoring algorithm. If the results hold up, they could undermine RSA keys of this size, which are still used in some legacy systems. Security researchers are likely to examine the claims and discuss whether 1024-bit RSA should now be considered practically breakable.
- 2
A fully interactive 3D model of the Enigma machine is now available online at enigma.design, letting users operate the famous World War II German cipher device in their browser. The project is drawing attention on Hacker News, with commenters praising its detail and educational value for demonstrating how the rotor-based encryption machine worked.
- 3
A new essay on the Cryptography Engineering blog asks whether sandboxing is sufficient to contain rogue autonomous AI agents. The piece examines whether technical isolation can really restrain software agents that misbehave or act beyond their intended goals. Readers are debating the limits of sandboxing as a safety measure as AI agents are deployed more widely.
- 4Cloudflare to issue quantum-safe TLS certificates▼Cloudflare plans to issue quantum-safe # TLS # certificates # Cloudflare said Tuesday it plans to issue quantum-proof TL
Cloudflare announced on Tuesday that it plans to issue quantum-proof TLS certificates, becoming one of the first certificate authorities to adopt cryptography designed to withstand attacks from quantum computers. The move addresses fears that future quantum machines could break today's encryption, exposing data collected now and decrypted later. Observers see it as a significant step in the industry's transition to post-quantum security.
- 5Shor's Algorithm and the Push for Post-Quantum Cryptography●# ITByte : Shor's # Algorithm is a # Quantum algorithm for finding the prime factors of an integer. It was developed in
Shor's algorithm, a quantum algorithm for finding the prime factors of an integer, was developed in 1994 by American mathematician Peter Shor. Its theoretical existence has driven a global shift toward post-quantum cryptography, as a sufficiently powerful quantum computer running it could break widely used encryption methods such as RSA that protect much of today's digital communication.
- 6Tech CEO warns quantum computing could break Bitcoin encryption▼Tech CEO warns quantum computing threatens Bitcoin encryption
A technology chief executive has publicly warned that advances in quantum computing could eventually threaten the encryption underpinning Bitcoin, raising concerns about the security of the cryptocurrency. The warning has fuelled broader debate about how prepared crypto networks are for quantum-era attacks and whether a transition to post-quantum cryptography is needed.
- 7Software Cryptography Audits Must Name Modules, Not Just Code Lines●Most of the cryptography your program runs was written by somebody else. A scan that stops at... # python # fintech # cr
Developers are being reminded that most cryptographic code running in modern programs was written by someone else, usually in third-party libraries. A cryptography inventory that only lists lines in a project's own source misses these dependencies. The argument is that proper audits must name the actual module providing each cryptographic function, a point seen as increasingly important for fintech and security-sensitive software.