<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Decryption on Bruno Pedro</title><link>https://brunopedro.com/tags/decryption/</link><description>Recent content in Decryption on Bruno Pedro</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 20 Apr 2018 10:46:55 +0200</lastBuildDate><atom:link href="https://brunopedro.com/tags/decryption/index.xml" rel="self" type="application/rss+xml"/><item><title>How to share a secret</title><link>https://brunopedro.com/2009/01/03/how-to-share-a-secret/</link><pubDate>Sat, 03 Jan 2009 17:15:38 +0000</pubDate><guid>https://brunopedro.com/2009/01/03/how-to-share-a-secret/</guid><description>&lt;p>&amp;ldquo;&lt;a href="http://portal.acm.org/citation.cfm?id=359168.359176" title="How to share a secret">How to Share a Secret&lt;/a>&amp;rdquo; is the title of paper written in 1979 by &lt;a href="http://en.wikipedia.org/wiki/Adi_Shamir" title="Adi Shamir">Adi Shamir&lt;/a> (best known for his work on the &lt;a href="http://en.wikipedia.org/wiki/RSA#History">RSA&lt;/a> algorithm). The paper describes a method for dividing information in smaller pieces so that the knowledge of all but one of the pieces gives absolutely no information about the original information. Quoting the author:&lt;/p>
&lt;blockquote>
&lt;p>This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.&lt;/p></description></item></channel></rss>