Sci-Fi Crypto - Revision history

PhilippeTeuwen: /* Proof-of-concept */

2015-05-25T11:48:48Z

Proof-of-concept

← Older revision		Revision as of 11:48, 25 May 2015
Line 77:		Line 77:
	The difficulty is the enumeration of paths that would cover the key space.		The difficulty is the enumeration of paths that would cover the key space.
	<br>For a first attempt I will keep the grammar links of the plaintext and replace every word by another which respects the same grammar structure.		<br>For a first attempt I will keep the grammar links of the plaintext and replace every word by another which respects the same grammar structure.
	<br>After scripting some bash around link-grammar and its ~~dictionnaries~~, here's what I get (see at the bottom of the page for source code):		<br>After scripting some bash around link-grammar and its dictionaries, here's what I get (see at the bottom of the page for source code):

	$ echo my example illustrates a mean to obfuscate a complex sentence easily with an impressive code\|./encode		$ echo my example illustrates a mean to obfuscate a complex sentence easily with an impressive code\|./encode
Line 92:		Line 92:
	@24:1 n.1:8481 v.4.2:1980 a n.1:1626 to v.4.1:469 a adj.1:6271 n.1:8763 adv.1:1393 with a @476:28 n.1:6878		@24:1 n.1:8481 v.4.2:1980 a n.1:1626 to v.4.1:469 a adj.1:6271 n.1:8763 adv.1:1393 with a @476:28 n.1:6878

	Here I'm changing the positions using a secret key with a very very stupid ~~16bit~~ numeric cipher.		Here I'm changing the positions using a secret key with a very very stupid 16-bit numeric cipher.

	$ echo my example illustrates a mean to obfuscate a complex sentence easily with an impressive code\|./encode 123\|./decode 123		$ echo my example illustrates a mean to obfuscate a complex sentence easily with an impressive code\|./encode 123\|./decode 123
Line 144:		Line 144:
	28381:our misfit videotapes a sensationalist to brand a unavoidable aspect royally with a debatable heliport		28381:our misfit videotapes a sensationalist to brand a unavoidable aspect royally with a debatable heliport
	^C		^C

	===Disclaimers===		===Disclaimers===
	This was just a proof-of-concept		This was just a proof-of-concept

PhilippeTeuwen: /* Feel free to share your opinion */

2014-07-29T13:20:13Z

Feel free to share your opinion

← Older revision		Revision as of 13:20, 29 July 2014
Line 509:		Line 509:
	===Feel free to share your opinion===		===Feel free to share your opinion===
	Philippe Teuwen <phil teuwen org>		Philippe Teuwen <phil teuwen org>
			<br>@doegox

PhilippeTeuwen: /* Lenticrypt */

2014-07-29T13:19:46Z

Lenticrypt

← Older revision		Revision as of 13:19, 29 July 2014
Line 505:		Line 505:

	====[https://github.com/ESultanik/lenticrypt Lenticrypt]====		====[https://github.com/ESultanik/lenticrypt Lenticrypt]====
	A simple cryptosystem that provides provable plausibly deniable encryption. Lenticrypt can generate a single ciphertext file such that different plaintexts are generated depending on which key is used for decryption.		''A simple cryptosystem that provides provable plausibly deniable encryption. Lenticrypt can generate a single ciphertext file such that different plaintexts are generated depending on which key is used for decryption.''

	===Feel free to share your opinion===		===Feel free to share your opinion===

PhilippeTeuwen: /* Related work */

2014-07-29T13:12:42Z

Related work

← Older revision		Revision as of 13:12, 29 July 2014
Line 503:		Line 503:
	<br>Best result if I read correctly is reducing initial text size of 100Mb to 15.95Mb (including the decompressor!).		<br>Best result if I read correctly is reducing initial text size of 100Mb to 15.95Mb (including the decompressor!).
	<br>For comparison, a 7zip self-extractible archive is 21.2Mb large.		<br>For comparison, a 7zip self-extractible archive is 21.2Mb large.

			====[https://github.com/ESultanik/lenticrypt Lenticrypt]====
			A simple cryptosystem that provides provable plausibly deniable encryption. Lenticrypt can generate a single ciphertext file such that different plaintexts are generated depending on which key is used for decryption.

	===Feel free to share your opinion===		===Feel free to share your opinion===

PhilippeTeuwen: /* Honey encryption and decoys (pdf) */

2014-02-01T09:35:51Z

Honey encryption and decoys (pdf)

← Older revision		Revision as of 09:35, 1 February 2014
Line 492:		Line 492:
	<br>''[...] To encrypt an English word so that the ciphertext is another English word.'' (added in April 2010)		<br>''[...] To encrypt an English word so that the ciphertext is another English word.'' (added in April 2010)
	<br><br>Once the sentence is tokenised, those techniques could help for a better word substitution		<br><br>Once the sentence is tokenised, those techniques could help for a better word substitution
	====[http://pages.cs.wisc.edu/~rist/papers/HoneyEncryptionpre.pdf Honey encryption and decoys] (pdf)====		====[http://pages.cs.wisc.edu/~rist/papers/HoneyEncryptionpre.pdf Honey encryption and decoys (pdf)]====
	''We introduce honey encryption, a form of password-based encryption in which decrypting with incorrect passwords yields fake, but realistic-looking, plaintexts.'' (added in January 2014)		''We introduce honey encryption, a form of password-based encryption in which decrypting with incorrect passwords yields fake, but realistic-looking, plaintexts.'' (added in January 2014)

PhilippeTeuwen: /* Honey encryption and decoys */

2014-02-01T09:35:38Z

Honey encryption and decoys

← Older revision		Revision as of 09:35, 1 February 2014
Line 492:		Line 492:
	<br>''[...] To encrypt an English word so that the ciphertext is another English word.'' (added in April 2010)		<br>''[...] To encrypt an English word so that the ciphertext is another English word.'' (added in April 2010)
	<br><br>Once the sentence is tokenised, those techniques could help for a better word substitution		<br><br>Once the sentence is tokenised, those techniques could help for a better word substitution
	====[http://pages.cs.wisc.edu/~rist/papers/HoneyEncryptionpre.pdf Honey encryption and decoys]====		====[http://pages.cs.wisc.edu/~rist/papers/HoneyEncryptionpre.pdf Honey encryption and decoys] (pdf)====
	''We introduce honey encryption, a form of password-based encryption in which decrypting with incorrect passwords yields fake, but realistic-looking, plaintexts.'' (added in January 2014)		''We introduce honey encryption, a form of password-based encryption in which decrypting with incorrect passwords yields fake, but realistic-looking, plaintexts.'' (added in January 2014)

PhilippeTeuwen: /* Format-preserving encryption */

2014-02-01T09:35:19Z

Format-preserving encryption

← Older revision		Revision as of 09:35, 1 February 2014
Line 492:		Line 492:
	<br>''[...] To encrypt an English word so that the ciphertext is another English word.'' (added in April 2010)		<br>''[...] To encrypt an English word so that the ciphertext is another English word.'' (added in April 2010)
	<br><br>Once the sentence is tokenised, those techniques could help for a better word substitution		<br><br>Once the sentence is tokenised, those techniques could help for a better word substitution
			====[http://pages.cs.wisc.edu/~rist/papers/HoneyEncryptionpre.pdf Honey encryption and decoys]====
			''We introduce honey encryption, a form of password-based encryption in which decrypting with incorrect passwords yields fake, but realistic-looking, plaintexts.'' (added in January 2014)

	====Those folks who treat foreign languages like ciphers====		====Those folks who treat foreign languages like ciphers====

PhilippeTeuwen: /* Those folks who try to compress natural language */

2012-11-27T17:02:32Z

Those folks who try to compress natural language

← Older revision		Revision as of 17:02, 27 November 2012
Line 499:		Line 499:
	====Those folks who try to compress natural language====		====Those folks who try to compress natural language====
	See [https://en.wikipedia.org/wiki/Hutter_Prize Hutter Prize]		See [https://en.wikipedia.org/wiki/Hutter_Prize Hutter Prize]
			<br>Best result if I read correctly is reducing initial text size of 100Mb to 15.95Mb (including the decompressor!).
			<br>For comparison, a 7zip self-extractible archive is 21.2Mb large.

	===Feel free to share your opinion===		===Feel free to share your opinion===

PhilippeTeuwen: /* Related work */

2012-11-27T16:53:09Z

Related work

← Older revision		Revision as of 16:53, 27 November 2012
Line 493:		Line 493:
	<br><br>Once the sentence is tokenised, those techniques could help for a better word substitution		<br><br>Once the sentence is tokenised, those techniques could help for a better word substitution

	====Those folks who ~~treated~~ foreign languages like ciphers====		====Those folks who treat foreign languages like ciphers====
	Check [http://www.isi.edu/~knight/ Kevin Knight's work], and [http://www.wired.com/dangerroom/2012/11/ff-the-manuscript/all/ this fascinating article] though which I discovered his work:		Check [http://www.isi.edu/~knight/ Kevin Knight's work], and [http://www.wired.com/dangerroom/2012/11/ff-the-manuscript/all/ this fascinating article] though which I discovered his work:
	<br>''Knight was part of an extremely small group of machine-translation researchers who treated foreign languages like ciphers—as if Russian, for example, were just a series of cryptological symbols representing English words. In code-breaking, he explained, the central job is to figure out the set of rules for turning the cipher’s text into plain words: which letters should be swapped, when to turn a phrase on its head, when to ignore a word altogether. Establishing that type of rule set, or “key,” is the main goal of machine translators too. Except that the key for translating Russian into English is far more complex. Words have multiple meanings, depending on context. Grammar varies widely from language to language. And there are billions of possible word combinations.''		<br>''Knight was part of an extremely small group of machine-translation researchers who treated foreign languages like ciphers—as if Russian, for example, were just a series of cryptological symbols representing English words. In code-breaking, he explained, the central job is to figure out the set of rules for turning the cipher’s text into plain words: which letters should be swapped, when to turn a phrase on its head, when to ignore a word altogether. Establishing that type of rule set, or “key,” is the main goal of machine translators too. Except that the key for translating Russian into English is far more complex. Words have multiple meanings, depending on context. Grammar varies widely from language to language. And there are billions of possible word combinations.''

			====Those folks who try to compress natural language====
			See [https://en.wikipedia.org/wiki/Hutter_Prize Hutter Prize]

	===Feel free to share your opinion===		===Feel free to share your opinion===

PhilippeTeuwen: /* Lexical natural language steganography systems with human interaction (pdf) */

2012-11-27T16:41:30Z

Lexical natural language steganography systems with human interaction (pdf)

← Older revision		Revision as of 16:41, 27 November 2012
Line 487:		Line 487:
	Word substitution over an IRC channel.		Word substitution over an IRC channel.
	<br>It's actually pure steganography: using e.g. choice between 4 synonyms to encode 2 bits		<br>It's actually pure steganography: using e.g. choice between 4 synonyms to encode 2 bits

	====[https://en.wikipedia.org/wiki/Format-preserving_encryption Format-preserving encryption]====		====[https://en.wikipedia.org/wiki/Format-preserving_encryption Format-preserving encryption]====
	''In cryptography, format-preserving encryption (FPE) refers to encrypting in such a way that the output (the ciphertext) is in the same format as the input (the plaintext). The meaning of "format" varies. Typically only finite domains are discussed, for example:''		''In cryptography, format-preserving encryption (FPE) refers to encrypting in such a way that the output (the ciphertext) is in the same format as the input (the plaintext). The meaning of "format" varies. Typically only finite domains are discussed, for example:''