/explore
|
You are here 
|
www.protectstar.com | ||
| | | | |
taro.codes
|
|
| | | | | [AI summary] A security-focused blog post explaining JavaScript encryption implementation using Node.js, detailing cipher algorithms like AES and ChaCha20, and discussing key lengths and security standards. | |
| | | | |
mfbmina.dev
|
|
| | | | | Introdução RSA is a public/private encryption algorithm and it is based on the difficulty of the factorization of the product of two large prime numbers. It was named after its creators Rivest, Shamir, and Adleman. It is an expensive algorithm, computationally speaking, and because of this, it is not common to use it directly, but it is still widely used in the market and is one of the most important encryption algorithms. As an example, OpenSSL implements this algorithm for generating keys and it is com... | |
| | | | |
dusty.phillips.codes
|
|
| | | | | The venerable RSA public key encryption algorithm is very elegant. It requires a basic understanding of modular arithmetic, which may sound scary if you havent studied it. It reduces to taking the remainder after integer long division. The RSA Wikipedia article describes five simple steps to generate the keys. Encryption and decryption are a matter of basic exponentiation. Theres no advanced math, and its easy to understand their example of working with small numbers. | |
| | | | |
rareskills.io
|
|
| | | Elliptic Curves over Finite Fields What do elliptic curves in finite fields look like? It's easy to visualize smooth elliptic curves, but what do elliptic curves over a finite field look like? The following is a plot of $y² = x³ + 3 \pmod {23}$ Because we only allow integer inputs (more specifically, finite field... | ||
