Cryptography

Go 1.24 Release Notes

Go 1.24 introduces significant performance improvements with a new Swiss Tables-based map implementation and enhanced memory allocation efficiency, reducing CPU overheads by 2-3%. The release adds support for ML-KEM post-quantum cryptography, FIPS 140-3 compliance mechanisms, and new testing tools for concurrent code.

XOR

A comprehensive explanation of the XOR operator, from its basic logic operations to advanced mathematical applications in cryptography, game theory, and finite fields, illustrated with practical examples in computing and theoretical concepts.

Why cryptography is not based on NP-complete problems

A detailed exploration of why cryptography relies on average-case hard problems rather than NP-complete problems, explaining how cryptographic security requires randomly selected problem instances to be consistently difficult. The discussion clarifies the distinction between worst-case hardness in complexity theory and the practical requirements for cryptographic security, using RSA as a primary example.

Alan Turing's Top Secret DIY Project

Alan Turing's secret 'Delilah' project from 1943-1945 resulted in a groundbreaking portable voice-encryption system, demonstrating his largely unknown expertise in electrical engineering. Recently discovered documents, known as the 'Bayley papers,' reveal Turing's detailed work on this innovative system that could encrypt and decrypt speech using pseudorandom number generation and advanced circuit design. The project showcased Turing's transition from theoretical mathematics to practical engineering, laying groundwork for his later contributions to computer design.