The algorithm would only be viable if you you would use a different secret
for every password. If the secret is reused, it can be broken with a single
known-plaintext attack. The recommendation is always don't do your own
crypto. Use PBKDF2, SHA256-CRYPT or Argon2 for password verification.
On W
When looking at hashing algorithms there's a whole lot of factors to
consider.
A few of the common considerations are:
1. performance.
2. cryptographic or not.
3. collision rate including avalanche effect and bit-size.
There are a bunch of other considerations but those are some high-level
conce
package mod
import (
"testing"
)
func TestEncrypt(t *testing.T) {
password := []byte("*RTFUGIHOD&TUGGIYKl")
data := []byte("This encryption algorithm is faster than aes256 up to 40kb
but how secure is it?")
for x, _ := range data {
p := (password[x%len(password)])
data[x] = data[x] + byte(p)
}
p
