crypto-numbers
ed25519
| crypto-numbers | ed25519 | |
|---|---|---|
| 1 | 15 | |
| 5 | 21 | |
| - | - | |
| 0.0 | 4.5 | |
| about 9 years ago | 5 months ago | |
| Haskell | C | |
| BSD 3-clause "New" or "Revised" License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
crypto-numbers
-
Rolling your own crypto: Everything you need to build AES from scratch
But you're approaching it from the wrong perspective: the idea isn't to use the crypto you implement yourself, the idea is to gain a better understanding of how the "magic" works. Of course my hand-rolled RSA/AES crypto is breakable, I know that because that's the default assumption.
It's akin to saying, "you're not allowed to build your own smoke detector because it will be unsafe!". Of course I know that, I want to understand the differences between a photoelectric and ionization smoke detector, how they work in practice, because reading some PDF schematics just doesn't cut it for me.
I honestly don't understand the line of reasoning of all this crypto gatekeeping.
Fun fact: while I was doing my crypto deep dive in 2015, my language of choice being Haskell, I found issues in several libraries, specifically around entropy, and even one library with modulo bias [1]. They were acknowledged and addressed. It was a super fun learning exercise, and seeing all these comments how it's supposedly almost illegal to do this misses the point of people exploring and learning in their own ways.
https://github.com/vincenthz/hs-crypto-numbers/commit/bceb54...
ed25519
-
Joining ChatCraft.org
The first step was to generate an ed25519 - ssh key for my Github account.
-
GitLab: Authentication and Signing with SSH Keys
From the GitLab documentation, ED25519 keys are recommended, as they are more secure and performant than RSA keys, according to the book Practical Cryptography With Go.
-
The Algorand Community Study Group just had our first meeting yesterday. We read Chapter 15 Elliptic Curve Cryptography in A Graduate Course in Applied Cryptography (Boneh, Shoup). Are you interested in learning applied cryptography? Which topic should we cover next? Come join us!
Correction regarding Ed25519: The Edwards Digital Signature Algorithm (EdDSA) https://ed25519.cr.yp.to/ was developed by a team including Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, and Bo-Yin Yang. The first paper came out in 2011.
-
[Sysadmin] Quel est le niveau de sécurité de la clé ed25519 par rapport à la clé ecdsa ou rsa pour les clés ssh ?
Les concepteurs de l'algorithme estimation :
- Have you been hacked? Tell your story
-
How SHA-256 Works Step-By-Step
Ed25519
- Обзор Aptos SDK
- Руководство по Созданию подписанной транзакции
-
Концепции APTOS | Учетные записи
Ed25519 для транзакций с одной подписью, и
-
Is your SSH key still safe?
> For the ED25519, the key size should be 256 or larger.
This tripped my bullshit filter. ED25519 is 256 bits always: https://ed25519.cr.yp.to/
What are some alternatives?
secp256k1 - Haskell bindings for secp256k1 library
elocrypt - Generate easy-to-remember, hard-to-guess passwords
cryptohash-sha256 - Fast, pure and practical SHA-256 implementation
crypto-pubkey - DEPRECATED - use cryptonite - Cryptographic public key related algorithms in haskell (RSA,DSA,DH,ElGamal)
cipher-aes - DEPRECATED - use cryptonite - a comprehensive fast AES implementation for haskell that supports aesni and advanced cryptographic modes.
cryptoconditions - Interledger Crypto-Conditions in Haskell
servant-hmac-auth - Servant authentication with HMAC
ripple - Implementation of Ripple client protocol in Haskell
bcrypt - Haskell bindings for bcrypt
crypto-rng - Cryptographic random number generator.
lol - Λ ⚬ λ: Functional Lattice Cryptography