SHAMIR, A. Personal communications, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Micropayments Revisited - Micali, Rivest (2002) (10 citations) (Correct)
....cantly faster are currently available. Moreover, the computational cost of a public key signature has continued to decrease due to the deployment of more powerful processors. Furthermore, we note that the use of on line o line digital signatures (as proposed in [3] and recently improved in [17]) may be a good choice for micropayment schemes. 3 In sum, we now feel free to utilize public key computations even in most micropayment schemes. 2 The MR1 Scheme In this section we improve Rivest s lottery scheme. As before, payments will be selected to be deposited according to a selection ....
Adi Shamir, 2001. Personal communication.
An Efficient Membership-Query Algorithm for Learning DNF with.. - Jackson (1994) (42 citations) (Correct)
....proof that our result could be extended to a strong noise tolerant algorithm for DNF. However, that proof overlooked the fact that the boosting distributions D i generated by F1 are not only dependent on the target function and weak hypotheses produced, but are also noise dependent. Eli Shamir [45] apparently first discovered this error, and at the time of this writing in joint work with Clara Shwartzman seems near producing a modified noise tolerant algorithm for learning DNF with respect 48 to uniform. As indicated above, we focus on learning from a membership oracle that exhibits ....
E. Shamir. Personal communication.
The Magic Words Are Squeamish Ossifrage (Extended Abstract) - Atkins, Graff, Lenstra.. (Correct)
....40 quadrillion years using the best factoring algorithm known, assuming that a b (modc) could be computed in 1 nanosecond, for 125 digit numbers a, b, and c. 6 Thus, it is not surprising that the inventors of RSA felt confident that with such a huge modulus the message will never be recovered [23] and offered a 100 prize to the first successful decoder of the encrypted message. Interestingly, until the message was decoded, none of the parties involved remembered the expiration date of April 1, 1982, given in [20] but not in [6] With 10 9 modular multiplications per second, about 1:3 ....
A. Shamir, personal communication, April 1994.
Using the Fluhrer, Mantin, and Shamir Attack to Break WEP - Stubblefield, Ioannidis.. (2001) (4 citations) Self-citation (Shamir) (Correct)
....that there are other IVs that can result in a resolved state, and that testing all IVs instead of only the subset suggested by the Fluhrer et al. paper can be done in parallel with receiving packets. This conclusion We eventually traced this back to RFC 1042 [5] was verified by Adi Shamir [7], who also noted that these packets appear more often for higher key bytes. 4.2 Guessing Early Key Bytes As the Fluhrer, Mantin, and Shamir attack works by building on previously discovered key bytes, recovering early key bytes is critical. There are two approaches that we tried both separately ....
SHAMIR, A. Personal communications, 2001.
Using the Fluhrer, Mantin, and Shamir Attack to Break WEP - Stubblefield, Ioannidis.. (2001) (4 citations) Self-citation (Shamir) (Correct)
....are guessing and N is unrestricted) However, we found that there are other IVs that can result in a resolved state, and that testing all IVs instead of only the subset suggested by the Fluhrer et al. paper can be done in parallel with receiving packets. This conclusion was verified by Adi Shamir [10], who also noted that these packets appear more often for higher key bytes. 4.2 Guessing Early Key Bytes As the Fluhrer, Mantin, and Shamir attack works by building on previously discovered key bytes, recovering early key bytes is critical. There are two approaches that we tried both separately ....
A. Shamir. Personal communications, 2001.
Using the Fluhrer, Mantin, and Shamir Attack to Break WEP - Stubblefield, Ioannidis.. (2001) (4 citations) Self-citation (Shamir) (Correct)
....are guessing and N is unrestricted) However, we found that there are other IVs that can result in a resolved state, and that testing all IVs instead of only the subset suggested by the Fluhrer et al. paper can be done in parallel with receiving packets. This conclusion was verified by Adi Shamir [9], who also noted that these packets appear more often for higher key bytes. 4.2 Guessing Early Key Bytes As the Fluhrer, Mantin, and Shamir attack works by building on previously discovered key bytes, recovering early key bytes is critical. There are two approaches that we tried both separately ....
SHAMIR, A. Personal communications, 2001.
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