scrypt VS age

Check out the scrypt encryption tool.

Given that the encryption algorithm is open source (https://github.com/Tarsnap/scrypt) can you try to explain what you mean here?

I wouldn't use OpenSSL personally. If you just need simple but secure symmetric encryption, checkout the scrypt(1) encryption utility from Tarsnap. If you need support for public keys, check out age(1).

scrypt if you strictly only need symmetric encryption.

^ "scrypt page on the Tarsnap website". Retrieved 21 January 2014.

First of all I know that "implementing your own cryptography is bad". However, at some point, one does stumble upon a use-case that is not (well) covered by existing tools.

Now, assuming one has already done his due-diligence and has read (and hopefully understood at least the main ideas of) cryptography related articles / posts / etc. (especially in the area pertaining to what one wants to build), and thus we can assume one is not a complete newbie in this mater, however, nor is he an expert. Basically we can assume he is an "amateur".

Where would one go with his design to ask for feedback about it, in the hope to at least eliminate some weaknesses that one (as a non expert) might have overlooked. (I'm not speaking here about "proofs" or "audits".)

----

More specifically ---- but please let's not get into this right now, this being just an example ---- I'm trying to implement something similar to `scrypt` (the encryption utility, that uses the `scrypt` PBKDF, ) or `age` (), as a replacement to my current solution that relies on GnuPG.

It entirely does and that's exactly my point. Most "hashes" are designed to be fast, for data validation/checking whatever. For securing data (passwords, anonymisation, etc) you want a "hash" to be as slow as possible. Scrypt for example is designed to be extremely slow and use much memory (making GPU-based parallelisation useless and driving up the cost of CPU-based work). The default settings for five-second hashes changes their 18 hour estimate to a bit over two years... and that's assuming you don't turn it up further.

age

and echoing the result after converting to an age private key

I like that https://github.com/FiloSottile/age has small public keys.

> something fresh

It exists, it's called age..

Some random links

https://github.com/FiloSottile/age

https://www.reddit.com/r/crypto/comments/hr64hr/state_of_age...

https://github.com/FiloSottile/age/discussions/432

> (Acquiring keys, rotating keys, identifying compromised keys, and most importantly either reaches a large enough percentage of emails..

Oh nevermind, age doesn't do any of that. Indeed, it doesn't even do email https://github.com/FiloSottile/age/issues/93

Encrypted secrets thanks to SOPS and Age

I never heard of "Age" before this post. Thank you to share. If others are interested to learn more, here are two other interesting posts about Age:

https://github.com/FiloSottile/age/discussions/432

https://words.filippo.io/dispatches/age-authentication/

of all things I was able to resolve the issue via this github issue: https://github.com/FiloSottile/age/issues/370#issuecomment-1...

Why keep something secret on a public repo? Is that not an oxymoron?

Also, I’m terms of encryption something like age[0] makes it much easier to not shoot yourself in the foot.

[0] https://github.com/FiloSottile/age

Why RSA specifically? For backups, I recommend Tarsnap. But if you really don't want to pay for encrypted cloud hosting, then check out age encryption.