The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
New Public-Key Cryptosystem Using Braid Groups
Open accessOverview
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Stanley, R. P., & Rota, G.-C. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511805967 · Cited by 6,025
Stanley, R. P. (1986) · Springer eBooks · doi:10.1007/978-1-4615-9763-6 · Cited by 1,796
Braids, Links, and Mapping Class Groups
Birman, J. S. (1974) · International Linear Collider · Cited by 1,626
Artin, E. (1947) · The Annals of Mathematics · doi:10.2307/1969218 · Cited by 969
Hiding information and signatures in trapdoor knapsacks
Merkle, R., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055927 · Cited by 827
TWENTY YEARS OF ATTACKS ON THE RSA CRYPTOSYSTEM
Boneh, D. (1999) · Cited by 568
Braids, Links, and Mapping Class Groups. (AM-82)
Birman, J. S. (1975) · Princeton University Press eBooks · doi:10.1515/9781400881420 · Cited by 505
Public-key cryptosystems from lattice reduction problems
Goldreich, O., Goldwasser, S., & Halevi, S. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052231 · Cited by 482
An algebraic method for public-key cryptography
Anshel, I. L., Anshel, M., & Goldfeld, D. M. (1999) · Mathematical Research Letters · doi:10.4310/mrl.1999.v6.n3.a3 · Cited by 395
On the security of ElGamal based encryption
Tsiounis, Y., & Yung, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054019 · Cited by 380
Algebraic aspects of cryptography
(1998) · Choice Reviews Online · doi:10.5860/choice.36-2204 · Cited by 336
A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
Shamir, A. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056964 · Cited by 275
The rise and fall of knapsack cryptosystems
Odlyzko, A. M. (1991) · Proceedings of Symposia in Applied Mathematics · doi:10.1090/psapm/042/1095552 · Cited by 187
A key distribution system equivalent to factoring
McCurley, K. S. (1988) · Journal of Cryptology · doi:10.1007/bf02351718 · Cited by 176
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
Koyama, K., Maurer, U. M., Okamoto, T., & Vanstone, S. A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_20 · Cited by 170
A Public-Key Cryptosystem Based on the Word Problem
Wagner, N. R., & Magyarik, M. R. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_3 · Cited by 123
Smith, P. J., & Lennon, M. (1993) · Cited by 110
A note on the complexity of cryptography (Corresp.)
Brassard, G. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056010 · Cited by 68
Knapsack Public Key Cryptosystems and Diophantine Approximation
Lagarias, J. C. (1984) · Springer eBooks · doi:10.1007/978-1-4684-4730-9_1 · Cited by 49
Cryptanalysis of the Chor-Rivest cryptosystem
Vaudenay, S. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055732 · Cited by 32
Some Public-Key Crypto-Functions as Intractable as Factorization
Williams, H. C. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_7 · Cited by 18
Cited by
Lightweight Mutual Authentication for IoT and Its Applications
Li, N., Liu, D., & Nepal, S. (2017) · IEEE Transactions on Sustainable Computing · doi:10.1109/tsusc.2017.2716953 · Cited by 166
Metadata
- Authors
- Ko, K. H., Lee, S. J., Cheon, J. H., Han, J. W., Kang, J.-S., & Park, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 166-183
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1510717485
- Cited by
- 408
- References
- 27
- FWCI
- 7.61
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
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.