R. Rivest, A. Shamir, and L. M. Adelman, Cryptographic Communications System and Method, US Patent 4,405,829, 1983. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Object Management for Network-Centric Systems with Mobile.. - Lavva, Holder, Ben-Shaul (1997) (Correct)
....ac.il ID Class 27c5ff377b8edc49 MySpecialClass Figure 5. ACL Example nature assignment can only be done by MOM, to prevent false signatures and to enforce validity of ACL checks. Furthermore, signatures should be encrypted (using, for example, Rivest Shamir Adelman s public key algorithm (RSA) [16]) to prevent from forging them. Incorporation of encryption techniques for authentication is currently under progress. ACLs provide a security specification mechanism, namely a mechanism to specify the desired security policy of an object. Security specification must be accompanied by an ....
R. Rivest, A. Shamir, and L. Adelman. Cryptographic Communications System and Method, 1983. US Patent 4.405.829.
The Anonymous E-mail Conversation - Gülcu (1995) (Correct)
....backing. pgp combines the convenience of public key algorithms 1 Representing more than 6000 lines of source code. The Anonymous E mail Conversation Page 33 of IBM with the high speed of conventional cryptography. It offers full blown message privacy and authentication, based on RSA [30] and IDEA [14, 15] According to Zimmerman, the author of pgp, it was designed with the public masses in mind to provide good user ergonomy. As a consequence, pgp is well adapted for interactive use and its popularity is well deserved. Unfortunately, this is not the case for automated ....
R. Rivest, A. Shamir, and L. M. Adleman, "Cryptographic Communications System and Method," U.S Patent 4,405,829, 20 Sep 1983.
Secret Sets and Applications - Molva, Tsudik (1997) (Correct)
....above, we now consider a straight forward extension. It involves representing any secret set S as a sequence of n blocks, regardless of the real number of members in S. The length of a block is determined by the (globally set) public key encryption block size, e.g. modulus length in case of RSA [5]. If ST j 2 S, the j th block is PK j (txt j ) as before. Otherwise, the j th block is a sequence of random bits the length of the standard encryption block. This has two attractive features: 1. Increased efficiency: since blocks are ordered and there are as many blocks as members, only one ....
....Finally, since encryption block size for a typical conventional cryptosystem is smaller than that for a typical public key cryptosystem, spatial complexity can be reduced. For example, an eightfold decrease in length can be obtained if IDEA [4] 128 bit keys) is used instead of RSA [5] with 1024 bit moduli. 4 CRT Construction It is evident from the preceding discussion that the simple minded solutions are inefficient owing to both computational and spatial complexity. This is besides lacking any notion of elegance. In order to remedy the situation, we now base the ....
R. Rivest, A. Shamir, and L. M. Adleman, Cryptographic Communications System and Method, U.S Patent 4,405,829, September 1983.
Mixing Email with BABEL - Gülcü, Tsudik (1996) (1 citation) (Correct)
....or PGP It being the most popular email encryption software, we chose pgp to provide the cryptographic base. pgp combines the convenience and security of publickey algorithms with the high speed of conventional cryptography. It offers full blown message privacy and authentication, based on RSA [30] and IDEA [14, 15] Since it was designed with the mass appeal in mind, pgp is well suited for interactive use. Unfortunately, this is not the case for automated (batch) processing; error conditions require unexpected user interaction, and the return codes are at times confusing. 8.2.1 PGP file ....
R. Rivest, A. Shamir, and L. M. Adleman, "Cryptographic Communications System and Method," U.S Patent 4,405,829, 20 Sep 1983.
Playing Hide and Seek With Stored Keys - Adi Shamir And (1998) (6 citations) Self-citation (Shamir) (Correct)
....extensions for use when they might not otherwise be available. A hacker might maliciously want to subvert the security of a secure system or damage the code in a safety critical system. 2 Finding Secret RSA Keys In this section we assume that the attacker knows the public key n and e of an RSA[2] scheme used by his victim, and has temporary access to a long string of u bits (representing the full contents of the hard disk) which is known to contain the corresponding secret key d as a contiguous substring of v bits. A typical value of u can be 10 10 , while a typical value of v can be ....
R.L. Rivest, A. Shamir, and L.M. Adleman. Cryptographic communications system and method. U.S. Patent, 1983. U.S. Patent no. 4,405,829.
Using Behavior Templates to Design Remotely Executing Agents.. - Hung, Pasquale (2004) (Correct)
No context found.
R. Rivest, A. Shamir, and L. M. Adelman, Cryptographic Communications System and Method, US Patent 4,405,829, 1983.
Persistence and Security Support for Distributed Systems .. - Lavva, Ben-Shaul, Holder (1997) (Correct)
No context found.
R. Rivest, A. Shamir, and L. M. Adleman, Cryptographic Communications System and Method, 1983, US Patent 4.405.829.
The Need for Cryptographic Accelerators in Electronic Commerce - van Someren (1997) (Correct)
No context found.
R.L. Rivest, A. Shamir and L.M. Adleman. Cryptographic communications system and method. U.S. Patent no. 4,405,829 1983.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC