Explore >> Select a destination
|
You are here 
|
blog.lambdaclass.com | ||
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] The text provides an in-depth explanation of elliptic curve cryptography (ECC), covering fundamental concepts such as elliptic curves over finite fields, point addition, cyclic subgroups, subgroup orders, and the discrete logarithm problem. It also discusses practical aspects like finding base points, cofactors, and the importance of choosing subgroups with high order for cryptographic security. The text emphasizes that ECC relies on the difficulty of solving the discrete logarithm problem on elliptic curves, which is considered computationally hard and forms the basis for secure cryptographic protocols like ECDH and ECDSA. | |
| | | | |
blog.cryptohack.org
|
|
| | | | | Last weekend TetCTF held their new year CTF competition. I felt particularly nostalgic playing this, as it was the TetCTF 2020 CTF where Hyper and I played the crypto challenges and soon after decided to make CryptoHack together. Something about Ndh's crypto challenges really make me want to keep learning. | |
| | | | |
kndrck.co
|
|
| | | | | Motivation RSA (Rivest-Shamir-Adleman) is one of the first public-key cryptosystems and is widely used for secure data transmission. In such a cryptosystem, the encryption key is public and is different from the decryption key which is kept secret. If I wanted to comprehend zero knowledge proofs, then understanding the grand-daddy of public-key cryptosystems is a must. Background Maths Exponential Rules 1 $$ \begin{align} \label{eq:exponent_rule} g^{a-b} &= \dfrac{g^a}{g^b} \newline g^{a+b} &= g^a g^b \n... | |
| | | | |
patshaughnessy.net
|
|
| | | [AI summary] The article discusses the process of learning to read x86 assembly language, focusing on how it can be a useful skill for understanding low-level operations of microprocessors. It outlines the challenges of reading assembly, especially in debugging scenarios, and provides an example of translating Ruby code into x86 assembly using Crystal. The article also explains the syntax and structure of x86 assembly, including register usage, instruction suffixes, and the differences between AT&T and Intel syntax. It highlights the complexity of x86 assembly due to its historical evolution and the need for understanding register sizes and operand notation. | ||
