Neal Koblitz, A Course in Number Theory and Cryptography, 2ed, Springer, New York, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Securing Wireless Data: System Architecture Challenges - Srivaths Ravi Anand (2002) (Correct)
....exponentiation) must be performed using a large key, making it computationally expensive. Security protocols can now take advantage of alternative public key cryptosystems that provide high levels of security while demanding less computing and memory resources. Elliptic Curve Cryptosystems (ECC) [40] are based on the observation that there are no fast algorithms for computing discrete logarithms of points on elliptic curves. For a given level of security, the key sizes required in ECC, as well as the computed signatures, are smaller than RSA, making encryption more efficient. This feature ....
N. Koblitz, A Course in Number Theory and Cryptography. Springer-Verlag, 1987.
Algorithm Exploration for Efficient Public-Key.. - Potlapally, Ravi, .. (2002) (Correct)
....on extensive algorithmic exploration and tuning of the underlying cryptographic algorithms as the mechanism to achieve these objectives. The proposed techniques are complementary to, and can be applied in conjunction with, improvements in security mechanisms, protocols, and hardware architectures [7, 10, 11, 12, 13, 14, 15, 16]. For most secure wireless transactions, the processing at the client is dominated by the public key algorithm [7, 17] Hence, we focus on the encryption decryption operation used in most popular public key algorithms [3, 18] namely modular exponentiation . We present an extensive suite of ....
N. Koblitz, A Course in Number Theory and Cryptography. Springer-Verlag, 1987.
Optimizing Public-Key Encryption for Wireless Clients - Nachiketh Potlapally Srivaths (2002) (1 citation) (Correct)
.... The use of session caching to alleviate SSL related processing overheads is explored in [6] 16] The fact that public key algorithms often dominate security processing requirements has driven the recent development of alternative public key algorithms that offer reduced computational complexity [17], 18] Various companies offer commercial security processor ICs to improve the performance of transaction servers and network routers [19] 20] 21] 22] 23] 24] Architectural enhancements to high end microprocessor systems to improve their performance in security processing have been ....
N. Koblitz, A Course in Number Theory and Cryptography. SpringerVerlag, 1987.
Another Look at "Provable Security" - Koblitz, Menezes (2004) Self-citation (Koblitz) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography, SpringerVerlag, 1987.
Another Look at "Provable Security" - Koblitz, Menezes (2004) Self-citation (Koblitz) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography, SpringerVerlag, 1987.
A Survey of Public-Key Cryptosystems - Koblitz, Menezes Self-citation (Koblitz) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography, 2nd edition, Springer-Verlag, 1994.
The RSA Public Key Cryptosystem - William Wardlaw Mathematics (Correct)
No context found.
Neal Koblitz, A Course in Number Theory and Cryptography, 2ed, Springer, New York, 1994.
Algorithm Exploration for Efficient Public-Key.. - Handsets Nachiketh.. (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography. Springer-Verlag, 1987.
Optimizing Public-Key Encryption for Wireless Clients - Nachiketh Potlapally Srivaths (2002) (1 citation) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography. SpringerVerlag, 1987.
Speeding up Pollard's Rho Method for Computing Discrete Logarithms - Teske (1998) (20 citations) (Correct)
No context found.
N. Koblitz. A Course in Number Theory and Cryptography. Springer-Verlag, New York, 1987.
Security Analysis and Implementation of Password-based Cryptosystem - Bakuri (2005) (Correct)
No context found.
Neal Koblitz. A Course in Number Theory and Cryptography. SpringerVerlag, 1994.
A Verifiable Secret Shuffle and its Application to E-Voting - Neff (2001) (8 citations) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography, 2nd edition, Springer, 1994.
A Biometric Identity Based Signature Scheme - Burnett, Duffy, Dowling (2004) (Correct)
No context found.
N. Koblitz. A Course in Number Theory and Cryptography. Springer, 2nd edition, 1994.
Automatic Transcription Of Music - Klapuri (1998) (17 citations) (Correct)
No context found.
Koblitz. (1987). "A Course in Number Theory and Cryptography". Springer, Berlin.
Choosing Numbers for the Properties of Their - Squares Michael De (2004) (Correct)
No context found.
Neal Koblitz. A Course in Number Theory and Cryptography. SpringerVerlag, 1987.
Comments on a Threshold Proxy Signature Scheme Based on.. - Wang, Bao, Zhou, Deng (2004) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography, Springer- Verlag, 1994.
Efficient Data Mappings for Parity-Declustered Data Layouts - Schwabe, Sutherland (2002) (Correct)
No context found.
N. Koblitz, "A Course in Number Theory and Cryptography," Springer-Verlag (1987).
Some Parallel Algorithms for Integer Factorisation - Brent (1999) (5 citations) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, New York, 1994.
Breaking and Repairing Optimistic Fair Exchange from PODC 2003 - Dodis, Reyzin (2003) (7 citations) (Correct)
No context found.
N. Koblitz. A Course in Number Theory and Cryptography (second edition). Springer Verlag, New York, NY, 1994.
Some Parallel Algorithms for Integer Factorisation - Brent (1999) (5 citations) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, New York, 1994.
Verifiable Mixing (Shuffling) of ElGamal Pairs - Neff (2004) (1 citation) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography, 2nd edition, Springer, 1994.
Data Security - CM 0321 - Jones (2004) (Correct)
No context found.
N. Koblitz. A Course in Number Theory and Cryptography. Springer-Verlag, New York, 1987.
Signing XML Documents and the Concept of "What You See Is What .. - Scheibelhofer (2001) (Correct)
No context found.
Koblitz, N.: "A Course in Number Theory and Cryptography". Graduate Texts in Mathematics. Springer-Verlag New York, Inc. Second Edition 1994.
Shor's Discrete Logarithm Quantum Algorithm for Elliptic Curves - Proos, Zalka (2003) (1 citation) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography, SpringerVerlag, New York, 1994.
A Verifiable Secret Shuffle and its Application to E-Voting - Neff (2001) (8 citations) (Correct)
No context found.
N. Koblitz, A Course in Number Theory and Cryptography, 2nd edition, Springer, 1994.
First 50 documents Next 50
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