The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Algebraic aspects of cryptography
Abstract
1. Cryptography.- 1. Early History.- 2. The Idea of Public Key Cryptography.- 3. The RSA Cryptosystem.- 4. Diffie-Hellman and the Digital Signature Algorithm.- 5. Secret Sharing, Coin Flipping, and Time Spent on Homework.- 6. Passwords, Signatures, and Ciphers.- 7. Practical Cryptosystems and Useful Impractical Ones.- Exercises.- 2. Complexity of Computations.- 1. The Big-O Notation.- Exercises.- 2. Length of Numbers.- Exercises.- 3. Time Estimates.- Exercises.- 4. P, NP, and NP-Completeness.- Exercises.- 5. Promise Problems.- 6. Randomized Algorithms and Complexity Classes.- Exercises.- 7. Some Other Complexity Classes.- Exercises.- 3. Algebra.- 1. Fields.- Exercises.- 2. Finite Fields.- Exercises.- 3. The Euclidean Algorithm for Polynomials.- Exercises.- 4. Polynomial Rings.- Exercises.- 5. Grobner Bases.- Exercises.- 4. Hidden Monomial Cryptosystems.- 1. The Imai-Matsumoto System.- Exercises.- 2. Patarin's Little Dragon.- Exercises.- 3. Systems That Might Be More Secure.- Exercises.- 5. Combinatorial-Algebraic Cryptosystems.- 1. History.- 2. Irrelevance of Brassard's Theorem.- Exercises.- 3. Concrete Combinatorial-Algebraic Systems.- Exercises.- 4. The Basic Computational Algebra Problem.- Exercises.- 5. Cryptographic Version of Ideal Membership.- 6. Linear Algebra Attacks.- 7. Designing a Secure System.- 6. Elliptic and Hyperelliptic Cryptosystems.- 1. Elliptic Curves.- Exercises.- 2. Elliptic Curve Cryptosystems.- Exercises.- 3. Elliptic Curve Analogues of Classical Number Theory Problems.- Exercises.- 4. Cultural Background: Conjectures on Elliptic Curves and Surprising Relations with Other Problems.- 5. Hyperelliptic Curves.- Exercises.- 6. Hyperelliptic Cryptosystems.- Exercises.- 1. Basic Definitions and Properties.- 2. Polynomial and Rational Functions.- 3. Zeros and Poles.- 4. Divisors.- 5. Representing Semi-Reduced Divisors.- 6. Reduced Divisors.- 7. Adding Reduced Divisors.- Exercises.- Answers to Exercises.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Blake, I. F., Gao, X., Mullin, R. C., et al. (1993) · Springer eBooks · doi:10.1007/978-1-4757-2226-0_8 · Cited by 3
Cited by
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
Courtois, N., Klimov, A., Patarin, J., & Shamir, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_27 · Cited by 753
The State of Elliptic Curve Cryptography
Koblitz, N., Menezes, A., & Vanstone, S. (2000) · Designs, Codes and Cryptography · doi:10.1023/a:1008354106356 · Cited by 685
New Public-Key Cryptosystem Using Braid Groups
Ko, K. H., Lee, S. J., Cheon, J. H., Han, J. W., Kang, J.-S., & Park, C. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_10 · Cited by 408
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 1998-12-01
- Volume
- 36
- Issue
- 04
- Pages
- 36-2204-36-2204
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W2091826091
- Cited by
- 336
- References
- 1
- Type
- book review
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Algebraic aspects of cryptography. https://app.cochat.ai/papers/10.5860/choice.36-2204
- The paper
- Algebraic aspects of cryptography. (1998). Choice Reviews Online. https://doi.org/10.5860/choice.36-2204
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.