<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Alice and Bob - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Alice_and_Bob&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Alice_and_Bob&amp;p=6">3.Next</a>
</p>
<p>and Adleman's 1978 article "A method for obtaining digital signatures and public-key cryptosystems." They wrote, "For our scenarios we suppose that A and B (also known as Alice and Bob) are two users of a public-key cryptosystem". Previous to this article, cryptographers typically referred to message senders and receivers as A and B, or other simple symbols. In fact, in the two previous articles by Rivest, Shamir, and Adleman, introducing the <a href="page.php?w=RSA_%28cryptosystem%29">RSA cryptosystem</a>, there is no mention of Alice and Bob.</p><p>
<a accesskey="1" href="page.php?w=Alice_and_Bob&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Alice_and_Bob&amp;p=6">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
