Christopher J. Monico  Home/Search
Context Related
| nd.edu/~rosen/Paper...ThesisChris.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nd.edu/~rosen/preprints (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: by Christopher J. Monico In this dissertation, several generalizations of cryptographic protocols based on the Discrete Logarithm Problem (DLP) are examined. (Update)
Context of citations to this paper: More
...groups. In recent time there has been intense study of the discrete logarithm problem in the group over an elliptic curve [2, 7, 10] In [3, 12] the discrete logarithm problem in finite matrix rings have been studied and it has been shown that this necessitates good examples of...
Cited by: More
Public Key Cryptography Based on Simple Modules Over Simple .. - Maze, Monico, Rosenthal (2002) (Correct)
Active bibliography (related documents): More All
0.8: Reaction Attacks on Public Key Cryptosystems Based on the.. - Vasco, Steinwandt (2002) (Correct)
0.5: Constructing Isogenies Between Elliptic Curves Over Finite Fields - Galbraith (1999) (Correct)
0.5: Cryptanalysis of the CFVZ cryptosystem - Joan-Josep Climent Departament (2006) (Correct)
Similar documents based on text: More All
0.1: Automatic Acquisition of Language Models for Speech recognition - McCandless (1994) (Correct)
0.1: Building an Active Node on the Internet - Murphy (1997) (Correct)
0.1: A Learning Approach to Personalized Information Filtering - Sheth (1994) (Correct)
BibTeX entry: (Update)
C. Monico. Semirings and Semigroup Actions in Public-Key Cryptography. PhD thesis, University of Notre Dame, May 2002. Available at http://www.nd.edu/rosen/preprints.html. 8 http://citeseer.ist.psu.edu/monico02semirings.html More
@misc{ monico02semirings,
author = "C. Monico",
title = "Semirings and Semigroup Actions in Public-Key Cryptography",
text = "C. Monico. Semirings and Semigroup Actions in Public-Key Cryptography.
PhD thesis, University of Notre Dame, May 2002. Available at http://www.nd.edu/rosen/preprints.html.
8",
year = "2002",
url = "citeseer.ist.psu.edu/monico02semirings.html" }
Citations (may not include all citations):635 New directions in cryptography - Die, Hellman - 1976
601 A public key cryptosystem and a signature scheme based on di.. (context) - ElGamal - 1985
352 A Course in Computational Algebraic Number Theory (context) - Cohen - 1993
257 Elliptic curve cryptosystems (context) - Koblitz - 1987
241 Communication theory of secrecy systems (context) - Shannon - 1949
168 An improved algorithm for computing logarithms over GF (context) - Pohlig, Hellman - 1978
164 Polynomial-time algorithms for prime factorization and discr.. - Shor - 1997
124 The Art of Computer Programming: Vol (context) - Knuth - 1988
119 Elliptic Curves in Cryptography - Blake, Seroussi et al. - 1999
116 Algorithmic Number Theory (context) - Bach, Shallit - 1996
103 Factoring polynomials with rational coecients (context) - Lenstra, Lenstra et al. - 1982
97 Using Algebraic Geometry (context) - Cox, Little et al. - 1998
66 A computational approach to commutative algebra (context) - Becker, Weispfenning et al. - 1993
64 CRC Press Series on Discrete Mathematics and its Application.. (context) - Menezes, van Oorschot et al. - 1997
63 A public-key cryptosystem based on algebraic coding theory (context) - McEliece - 1978
63 Monte Carlo methods for index computation (context) - Pollard - 1978
27 An algebraic method for public-key cryptography - Anshel, Anshel et al. - 1999
26 Direct methods for primary decomposition (context) - Eisenbud, Huneke et al. - 1992
23 Algebraic Aspects of Cryptography (context) - Koblitz - 1998
22 Graduate Texts in Mathematics (context) - Hungerford - 1980
20 Faster attacks on elliptic curve cryptosystems - Wiener, Zuccherato - 1999
16 Multiuser cryptographic techniques (context) - Die, Hellman - 1976
16 Solving zero-dimensional algebraic systems (context) - Lazard - 1992
16 Towards the equivalence of breaking the Die-Hellman protocol.. (context) - Maurer - 1994
13 Fast evaluation of logarithms in elds of characteristic two (context) - Coppersmith - 1984
11 volume 5 of EATCS Monographs on Theoretical Computer Science (context) - Kuich, Salomaa et al. - 1986
9 volume 3 of Graduate Studies in Mathematics (context) - Adams, Loustaunau et al. - 1994
8 On random walks for Pollard's rho method - Teske - 2000
8 using the number eld sieve (context) - Gordon, in - 1993
5 Ecient computation of zero-dimensional Grobner bases by a c.. (context) - Faug, Gianni et al. - 1993
4 obner bases and primary decomposition of polynomial ideals (context) - Gianni, Trager et al. - 1988
3 Cryptanalysis of two cryptosystems based on group actions (context) - Blackburn, Galbraith - 1999
2 A public-key cryptosystem based on actions by semigroups (context) - Rosenthal, Maze et al. - 2002
2 Simple commutative semirings (context) - Bashir, Hurt et al. - 2001
2 The discrete logarithm problem in Gl (context) - Menezes, Wu - 1997
2 Finding isomorphisms between nite elds (context) - Lenstra - 1991
2 Public-key cryptosystems using the modular group (context) - Yamamura - 1998
2 Polynomial Time Algorithms for the Factorization of Polynomi.. (context) - Lenstra - 1984
1 and pseudorandom number generators (context) - Anshel, Goldfeld et al. - 1997
1 and two kinds of division semirings (context) - Weinert, -simple et al. - 1984
1 Dover Publications (context) - Warner - 1965
1 Note on a simple type of algebra in which the cancellation l.. (context) - Vandiver - 1934
1 Public key cryptography based on simple modules over simple .. - Maze, Monico et al. - 2002
1 and the discrete logarithm problem (context) - Menezes, Vanstone et al. - 1992
1 Singular : A computational algebra package (context) - Kaiserslautern - 2002
1 Semirings and Semi elds (context) - Hebisch, Weinert - 1996
1 Congruence-free commutative semirings (context) - Mitchell, Fenoglio - 1988
1 two new families of asymetric algorithms (context) - Patarin, equations et al. - 1996
1 Computing the primary decomposition of zero-dimensional idea.. (context) - Monico - 2000
1 Using low density parity check codes in the McEliece cryptos.. (context) - Monico, Rosenthal et al. - 2000
Documents on the same site (http://www3.nd.edu/~rosen/preprints.html): More
On Output Feedback Invariants and Cascade Equivalence of.. - Ravi, Rosenthal, Helmke (1997) (Correct)
Dynamic Pole Assignment and Schubert Calculus - Ravi, Rosenthal, Wang (1996) (Correct)
Output Feedback Pole Placement with Dynamic Compensators - Rosenthal, Wang (1996) (Correct)
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