-
Notifications
You must be signed in to change notification settings - Fork 43
Encryption spec #3191
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: develop
Are you sure you want to change the base?
Encryption spec #3191
Conversation
// Do we need random access to the encrypted bytes? Since our individual blocks are relatively small there should be a minor | ||
// difference between slicing the block and decrypting the whole thing, however, maybe there is? | ||
// AES_CTR = 1, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think for 2MB segments the performance difference could be meaningful for random-access. Basically if we use GCM and we have multi-MB blocks, we lose the benefit of the granular zone maps. Maybe that's just the price you pay?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think we can write a benchmark to measure this. Would tell us how big is the difference. There’s also storage overhead. Generally nonces in gcm are random but ctr lets you get away with counter
|
This isn't necessarily true for memory-mapped files |
I think for memory mapped files the overhead of reading additional 12-16 bytes might not be that relevant but could would let us skip loading one extra page |
There's still some extraneous comments in the flatbuffer that need answering