summaryrefslogtreecommitdiffhomepage
path: root/keysafe.hs
Commit message (Collapse)AuthorAge
...
* progress display for storingJoey Hess2016-08-17
|
* add progress bars to restoreJoey Hess2016-08-17
| | | | also, restore actually works!
* improve layoutJoey Hess2016-08-16
|
* allow shorter nameJoey Hess2016-08-16
|
* improve cost tableJoey Hess2016-08-16
|
* add cost estimatesJoey Hess2016-08-16
|
* key selection workingJoey Hess2016-08-16
|
* more command line interface improvementsJoey Hess2016-08-16
|
* improve options to select secret key to backup/restoreJoey Hess2016-08-16
|
* add --benchmarkJoey Hess2016-08-16
|
* switch to random salt byte to make decryption expensiveJoey Hess2016-08-16
|
* prompt for nameJoey Hess2016-08-12
|
* add --gui optionJoey Hess2016-08-12
|
* option parsingJoey Hess2016-08-12
|
* improve output slightlyJoey Hess2016-08-12
|
* add checksum to encrypted dataJoey Hess2016-08-12
| | | | Needed to verify decryption puzzles
* zero-pad size of padded bytesJoey Hess2016-08-11
|
* disable decryption puzzle, at least for nowJoey Hess2016-08-11
| | | | | | | | It only adds 1 minute GPU time to each crack attempt, on top of the 10 minutes CPU time needed to argon2 the password. Since my implementation of the AES puzzle is currently really slow, this is not worth it. Will revisit when I have a faster AES library to use, or a better puzzle.
* don't use IV as puzzle after allJoey Hess2016-08-11
| | | | | | | | Not a good idea to use IV, because all the parts of the IV that are 0 will not obscure the data in the first block at all. Instead, sha256 the password to generate the IV, and keep the puzzle as part of the key.
* guessing puzzle answersJoey Hess2016-08-11
|
* round-tripping now working, except for guessing the puzzleJoey Hess2016-08-11
|
* write via temp fileJoey Hess2016-08-11
| | | | | avoids short reads, and also if a backup program came along while the write was happening, avoids short backups
* obscure shard timestampsJoey Hess2016-08-11
|
* show brute force cost estimateJoey Hess2016-08-11
|
* show store successes/failuresJoey Hess2016-08-11
|
* pluggable object storage layerJoey Hess2016-08-11
|
* Shard data typeJoey Hess2016-08-11
|
* more todoJoey Hess2016-08-11
|
* partial demoJoey Hess2016-08-11
|
* inline slightly modified version of secret-sharingJoey Hess2016-08-11
| | | | | Needed for efficient serialization of shares, unless upstream takes my suggestion to make the finite field be size 256.
* nearly able to generate shards nowJoey Hess2016-08-11
|
* some basic data types and expensive hashingJoey Hess2016-08-06