Horcrux (jesseduffield) - Revision history

Dan Tobias at 04:10, 22 August 2020

2020-08-22T04:10:25Z

Dan Tobias at 03:11, 22 August 2020

2020-08-22T03:11:20Z

Dan Tobias at 03:07, 22 August 2020

2020-08-22T03:07:41Z

Dan Tobias at 03:06, 22 August 2020

2020-08-22T03:06:20Z

Dan Tobias at 03:00, 22 August 2020

2020-08-22T03:00:40Z

Dan Tobias: Created page with "{{FormatInfo |formattype=electronic |subcat=Encryption |extensions={{ext|horcrux}} }} A '''Horcrux''' is a concept from the Harry Potter universe whereby a dark wizard's soul ..."

2020-08-22T02:41:58Z

Created page with "{{FormatInfo |formattype=electronic |subcat=Encryption |extensions={{ext|horcrux}} }} A '''Horcrux''' is a concept from the Harry Potter universe whereby a dark wizard's soul ..."

New page

{{FormatInfo
|formattype=electronic
|subcat=Encryption
|extensions={{ext|horcrux}}
}}
A '''Horcrux''' is a concept from the Harry Potter universe whereby a dark wizard's soul is split into parts to make it more difficult to kill him. This format, from GitHub user jesseduffield, is one of two known implementations of a concept of file encryption and splitting inspired by this. (The other is [[Horcrux (kndyry)]].)

When you create a set of horcruxes from a file (using a command-line-based program that is distributed as open-source and has compiled executables for several systems), you can choose how many horcruxes to create and how many of them need to be gathered in order to reconstitute the file. For instance, you may have 5 horcruxes of which 3 are needed, so that any three of the horcruxes can be used to regenerate the original file. No additional decryption key is needed, since the key itself is rebuilt from the file headers.

Each of the horcrux files is the same length as the original file.

== Identification ==

Files start with this [[ASCII]] sequence: (with lines separated by linefeeds and the # character on the first character of each line)

# THIS FILE IS A HORCRUX.
# IT IS ONE OF 5 HORCRUXES THAT EACH CONTAIN PART OF AN ORIGINAL FILE.
# THIS IS HORCRUX NUMBER 1.
# IN ORDER TO RESURRECT THIS ORIGINAL FILE YOU MUST FIND THE OTHER 4 HORCRUX(ES) AND THEN BIND THEM USING THE PROGRAM FOUND AT THE FOLLOWING URL
# https://github.com/jesseduffield/horcrux

(where the numbers will vary depending on how the files were created)

This is followed by a <code>-- HEADER --</code> and <code>-- BODY --</code> section.

== Sample files ==
* [https://github.com/jesseduffield/horcrux/tree/master/example A sample set of horcruxes is here.]

== Links ==
* [https://github.com/jesseduffield/horcrux Github page]

@@ Line 4: / Line 4: @@
 |extensions={{ext|horcrux}}
 }}
-A '''Horcrux''' is a concept from the Harry Potter universe whereby a dark wizard's soul is split into parts to make it more difficult to kill him. This format, from GitHub user jesseduffield, is one of two known implementations of a concept of file encryption and splitting inspired by this. (The other is [[Horcrux (kndyry)]].)
+A '''Horcrux''' is a concept from the Harry Potter universe whereby a dark wizard/witch's soul is split into parts to make it more difficult to kill him/her. This format, from GitHub user jesseduffield, is one of two known implementations of a concept of file encryption and splitting inspired by this. (The other is [[Horcrux (kndyry)]].)
 When you create a set of horcruxes from a file (using a command-line-based program that is distributed as open-source and has compiled executables for several systems), you can choose how many horcruxes to create and how many of them need to be gathered in order to reconstitute the file. For instance, you may have 5 horcruxes of which 3 are needed, so that any three of the horcruxes can be used to regenerate the original file. No additional decryption key is needed, since the key itself is rebuilt from the file headers. [[Shamir's Secret Sharing]] is used to divide the key.

@@ Line 6: / Line 6: @@
 A '''Horcrux''' is a concept from the Harry Potter universe whereby a dark wizard's soul is split into parts to make it more difficult to kill him. This format, from GitHub user jesseduffield, is one of two known implementations of a concept of file encryption and splitting inspired by this. (The other is [[Horcrux (kndyry)]].)
-When you create a set of horcruxes from a file (using a command-line-based program that is distributed as open-source and has compiled executables for several systems), you can choose how many horcruxes to create and how many of them need to be gathered in order to reconstitute the file. For instance, you may have 5 horcruxes of which 3 are needed, so that any three of the horcruxes can be used to regenerate the original file. No additional decryption key is needed, since the key itself is rebuilt from the file headers.
+When you create a set of horcruxes from a file (using a command-line-based program that is distributed as open-source and has compiled executables for several systems), you can choose how many horcruxes to create and how many of them need to be gathered in order to reconstitute the file. For instance, you may have 5 horcruxes of which 3 are needed, so that any three of the horcruxes can be used to regenerate the original file. No additional decryption key is needed, since the key itself is rebuilt from the file headers. [[Shamir's Secret Sharing]] is used to divide the key.
 Each of the horcrux files is (usually) the same length as the original file. (This may not be the case if the original file was very small.)

@@ Line 26: / Line 26: @@
 The header is in [[JSON]] format with this structure (as given in the [[Go]] language source code):
- type HorcruxHeader struct {
+:type HorcruxHeader struct {
-	OriginalFilename string `json:"originalFilename"`
+::	OriginalFilename string `json:"originalFilename"`
-	Timestamp        int64  `json:"timestamp"`
+::	Timestamp        int64  `json:"timestamp"`
-	Index            int    `json:"index"`
+::	Index            int    `json:"index"`
-	Total            int    `json:"total"`
+::	Total            int    `json:"total"`
-	Threshold        int    `json:"threshold"`
+::	Threshold        int    `json:"threshold"`
-	KeyFragment      []byte `json:"keyFragment"`
+::	KeyFragment      []byte `json:"keyFragment"`
+: }
 == Sample files ==

← Older revision		Revision as of 03:06, 22 August 2020
Line 23:		Line 23:

	This is followed by a <code>-- HEADER --</code> and <code>-- BODY --</code> section.		This is followed by a <code>-- HEADER --</code> and <code>-- BODY --</code> section.
		+
		+	The header is in [[JSON]] format with this structure (as given in the [[Go]] language source code):
		+
		+	type HorcruxHeader struct {
		+	OriginalFilename string `json:"originalFilename"`
		+	Timestamp int64 `json:"timestamp"`
		+	Index int `json:"index"`
		+	Total int `json:"total"`
		+	Threshold int `json:"threshold"`
		+	KeyFragment []byte `json:"keyFragment"`
		+	}

	== Sample files ==		== Sample files ==

@@ Line 8: / Line 8: @@
 When you create a set of horcruxes from a file (using a command-line-based program that is distributed as open-source and has compiled executables for several systems), you can choose how many horcruxes to create and how many of them need to be gathered in order to reconstitute the file. For instance, you may have 5 horcruxes of which 3 are needed, so that any three of the horcruxes can be used to regenerate the original file. No additional decryption key is needed, since the key itself is rebuilt from the file headers.
-Each of the horcrux files is the same length as the original file.
+Each of the horcrux files is (usually) the same length as the original file. (This may not be the case if the original file was very small.)
 == Identification ==