About the work
This recent webcomic from xkcd, Password Strength, relates to what I’ve been investigating lately–the question of whether there need be a tradeoff between password strength and ease of recall, using, as usual, my knowledge of finite algorithmic information theory. While my conclusions will be presented in a paper in the next few months/years, the webcomic [...]
<http://feeds.feedburner.com/~ff/AnimaExMachina?a=w1DflwQFdFM:cq9HFavCjNE:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=
Print work information
Work information
Title A bit of cryptography, passwords strength, and sysadmins
This recent webcomic from xkcd, Password Strength, relates to what I’ve been investigating lately–the question of whether there need be a tradeoff between password strength and ease of recall, using, as usual, my knowledge of finite algorithmic information theory. While my conclusions will be presented in a paper in the next few months/years, the webcomic [...]
<http://feeds.feedburner.com/~ff/AnimaExMachina?a=w1DflwQFdFM:cq9HFavCjNE:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=
Work type Article
Tags general, natural language and computational linguistics
-------------------------
Registry info in Safe Creative
Identifier 1108179877733
Entry date Aug 17, 2011, 7:40 AM UTC
License Creative Commons Attribution Non-commercial No Derivatives 3.0
-------------------------
Copyright registered declarations
Author. Holder Hector Zenil Chavez. Date Aug 17, 2011.
Information available at https://www.safecreative.org/work/1108179877733-a-bit-of-cryptography-passwords-strength-and-sysadmins
/
Registration: 1108179877733
