Skip to content
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

Option for XOR implementation #5

Open
mcandre opened this issue Jan 3, 2020 · 2 comments
Open

Option for XOR implementation #5

mcandre opened this issue Jan 3, 2020 · 2 comments

Comments

@mcandre
Copy link

mcandre commented Jan 3, 2020

For users who want to require exactly N of N keys, XOR would be the safest, most performant, most reliable option.

@mcandre mcandre changed the title Why not XOR? Option for XOR implementation Jan 3, 2020
@jesseduffield
Copy link
Owner

I don't have a particularly strong background in encryption. Are you referring to the encryption step? Or the step where we write to the horcruxes.

For context, currently when we require N of N horcruxes, I'm writing through a demultiplexer to give the first 100 characters of the encrypted content to the first horcrux, the second 100 characters to the second horcrux, and so on.

@AyrA
Copy link

AyrA commented Aug 20, 2020

I don't have a particularly strong background in encryption. Are you referring to the encryption step? Or the step where we write to the horcruxes.

XOR encryption for "N out of N" is actually quite simple.
Instead of using SSS to generate N keys, you generate N random keys and XOR them all together. The result is your AES key.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants