I want to code my own primitive RetardoCurency just for fun and practise and one of the problems that has been bothering me a lot is the signatures
Does anyone here know a really simple way to Hash some data with a public key ? Or perhaps some really simple algorithm for asymmetric encryption with public keys ?
I've searched far and wide, and although I understand MD5 and SHA1/SHA2 I'd like to start with something really simple. I don't care how primitive/unsecure this algorithm could be , I just need it to work
Last thread 404, but I managed to formulate my question better
man dgst
good luck I guess.
https://en.wikipedia.org/wiki/SHA-3
>>61315004
the crypto library that you use should have hash algorithms and digital signature algorithms implemented
stop doing crypto yourself, you retard
>>61315004
>>>/sqt/
>>61315792
I am not doing this for any practical reason whatsoever, I am doing this for fun so I want to code my own hash function. And before I actually code any complicated ones like SHA I want to do something digestible, something easy
The question is does it exist ? Symmetric encryption has XOR cipher as the simplest example of that encryption, but do the asymmetric and hash have their own "example" algorithms ?
Maybe 256bit ed25519? Look at OpenBSD's signify.
>>61316972
The iconic asymmetric crypto example is RSA
https://en.wikipedia.org/wiki/RSA_(cryptosystem)
>>61316972
yea, just sum up bytes in a byte and return it
or Google simple hash function