Explore >> Select a destination
|
You are here 
|
principlesofcryptography.com | ||
| | | | |
blog.lambdaclass.com
|
|
| | | | | Introduction When working with cryptographic applications you need to understand some of the underlying math (at least, if you want to do things properly). For example, the RSA cryptographic system (which was one of the earliest methods and most widely adopted, until it lost ground to better methods, such as | |
| | | | |
mattbaker.blog
|
|
| | | | | In honor of Pi Day 2023, I'd like to discuss Hilbert's 7th Problem, which in an oversimplified (and rather vague) form asks: under what circumstances can a transcendental function take algebraic values at algebraic points? The connection with $latex \pi$ is that Lindemann proved in 1882 that the transcendental function $latex f(z) = e^z$ takes... | |
| | | | |
mikespivey.wordpress.com
|
|
| | | | | It's fairly well-known, to those who know it, that $latex \displaystyle \left(\sum_{k=1}^n k \right)^2 = \frac{n^2(n+1)^2}{4} = \sum_{k=1}^n k^3 $. In other words, the square of the sum of the first n positive integers equals the sum of the cubes of the first n positive integers. It's probably less well-known that a similar relationship holds... | |
| | | | |
0x44.cc
|
|
| | | [AI summary] The article provides an in-depth explanation of reverse engineering concepts, including CPU operations, memory representation, data structures, and disassembly techniques. It guides readers through understanding machine code, endianness, signed integers, and how to analyze C code using tools like Visual Studio and disassemblers. | ||
