1867-1144

journal of Groups complexity cryptology

Centre pour la Communication Scientifique Directe

Health Score

0 Poor

Metadata coverage

Abstract
ORCID
References
License

Extended metadata coverage

Informational — signals of interoperability and funding across the corpus. Not part of the health score.

Funding

Funder
Award / grant

Affiliation & institutional identifiers

Affiliation
ROR ID

Update policy

Update policy

Your prioritized action plan

Ordered by how many DOIs each fix touches — start here, not with every error at once.

1

Add license metadata to 183 records

License metadata tells indexers and readers how each article may be reused.

High impact183 DOIs
2

Attach ORCID iDs across 174 articles

ORCID iDs strengthen author disambiguation and institutional reporting.

High impact174 DOIs
3

Add abstracts to 106 articles

Abstracts are what surface your work in Google Scholar, Dimensions, and OpenAlex.

High impact106 DOIs

DOIs for this ISSN

Showing the top 5 of 176 DOIs, ordered by correction priority.

# Title Missing Priority Citations
1 Algorithmics on SLP-compressed strings: A survey (10.1515/gcc-2012-0016)
Abstract References ORCID License
192.94 84
2 Public key exchange using matrices over group rings (10.1515/gcc-2013-0007)
Abstract References ORCID License
171.60 51
3 Isomorphism in expanding families of indistinguishable group… (10.1515/gcc-2012-0008)
Abstract References ORCID License
144.72 27
4 Equations over groups (10.1515/gcc-2012-0015)
Abstract References ORCID License
139.79 24
5 Existence, algorithms, and asymptotics of direct product dec… (10.1515/gcc-2012-0007)
Abstract References ORCID License
130.10 19
6 Groups with poly-context-free word problem (10.1515/gcc-2014-0002)
Abstract References ORCID License
117.61 14
7 Shortlex automaticity and geodesic regularity in Artin group… (10.1515/gcc-2013-0001)
Abstract References ORCID License
111.39 12
8 An update on Hurwitz groups (10.1515/gcc.2010.002)
Abstract ORCID License
108.54 27
9 Non-commutative digital signatures (10.1515/gcc-2012-0019)
Abstract References ORCID License
107.92 11
10 A Diffie–Hellman key exchange protocol using matrices over n… (10.1515/gcc-2012-0001)
Abstract ORCID License
107.35 26
11 A linear decomposition attack (10.1515/gcc-2015-0007)
References ORCID License
107.35 26
12 Quantum algorithm for discrete logarithm problem for matrice… (10.1515/gcc-2014-0003)
Abstract References ORCID License
100.00 9
13 Another look at non-uniformity (10.1515/gcc-2013-0008)
Abstract References ORCID License
95.42 8
14 Algebraic attacks using SAT-solvers (10.1515/gcc.2010.016)
Abstract ORCID License
94.15 17
15 On the cogrowth of Thompson's group F (10.1515/gcc-2012-0018)
Abstract References ORCID License
90.31 7
16 On Cayley graphs of virtually free groups (10.1515/gcc.2011.012)
Abstract ORCID License
85.96 13
17 How to compute the Wedderburn decomposition of a finite-dime… (10.1515/gcc.2011.003)
Abstract ORCID License
78.10 10
18 Search and test algorithms for triple product property tripl… (10.1515/gcc-2012-0006)
Abstract References ORCID License
77.82 5
19 A Complete Public-Key Cryptosystem (10.1515/gcc.2009.1)
Abstract ORCID License
75.00 9
20 Authentication from Matrix Conjugation (10.1515/gcc.2009.199)
Abstract ORCID License
75.00 9
21 Cutting up graphs revisited – a short proof of Stallings' st… (10.1515/gcc.2010.013)
Abstract ORCID License
75.00 9
22 Algebraic Attacks Galore! (10.1515/gcc.2009.231)
Abstract ORCID License
71.57 8
23 Evolutionary algorithm solution of the multiple conjugacy se… (10.1515/gcc-2012-0002)
Abstract References ORCID License
69.90 4
24 On the intersection of subgroups in free groups: Echelon sub… (10.1515/gcc-2013-0013)
Abstract References ORCID License
69.90 4
25 The discrete logarithm problem in the group of non-singular… (10.1515/gcc.2010.006)
Abstract ORCID License
67.73 7
26 Some geodesic problems in groups (10.1515/gcc.2010.014)
Abstract ORCID License
67.73 7
27 An introduction to computable model theory on groups and fie… (10.1515/gcc.2011.002)
Abstract ORCID License
67.73 7
28 Polynomial time conjugacy in wreath products and free solvab… (10.1515/gcc.2011.005)
Abstract ORCID License
67.73 7
29 Palindromic width of wreath products, metabelian groups, and… (10.1515/gcc-2014-0009)
References ORCID License
63.38 6
30 Non-abelian analogs of lattice rounding (10.1515/gcc-2015-0010)
References ORCID License
63.38 6
31 Cyclic rewriting and conjugacy problems (10.1515/gcc-2012-0020)
Abstract References ORCID License
60.21 3
32 Constructing a pseudo-free family of finite computational gr… (10.1515/gcc-2013-0003)
Abstract References ORCID License
60.21 3
33 A secret sharing scheme based on the Closest Vector Theorem… (10.1515/gcc-2013-0012)
Abstract References ORCID License
60.21 3
34 On torsion in finitely presented groups (10.1515/gcc-2014-0001)
Abstract References ORCID License
60.21 3
35 An improved version of the AAG cryptographic protocol (10.1515/gcc-2019-2003)
ORCID License
60.21 15
36 Almost Locally Free Groups and a Theorem of Magnus: Some Que… (10.1515/gcc.2009.181)
Abstract ORCID License
58.36 5
37 Decision and Search in Non-Abelian Cramer-Shoup Public Key C… (10.1515/gcc.2009.217)
Abstract ORCID License
58.36 5
38 Space Complexity and Word Problems of Groups (10.1515/gcc.2009.261)
Abstract ORCID License
58.36 5
39 Generic Subgroups of Group Amalgams (10.1515/gcc.2009.51)
Abstract ORCID License
58.36 5
40 Actions of the Braid Group, and New Algebraic Proofs of Resu… (10.1515/gcc.2009.77)
Abstract ORCID License
58.36 5
41 The diameter of a random Cayley graph of ℤ q (10.1515/gcc.2010.004)
Abstract ORCID License
58.36 5
42 The Latin squares and the secret sharing schemes (10.1515/gcc.2010.011)
Abstract ORCID License
58.36 5
43 Growth rate of an endomorphism of a group (10.1515/gcc.2011.011)
Abstract ORCID License
58.36 5
44 The status of polycyclic group-based cryptography: A survey… (10.1515/gcc-2016-0013)
ORCID License
57.31 13
45 Knapsack problem for nilpotent groups (10.1515/gcc-2017-0006)
ORCID License
57.31 13
46 Two general schemes of algebraic cryptography (10.1515/gcc-2018-0009)
ORCID License
57.31 13
47 A nonlinear decomposition attack (10.1515/gcc-2016-0017)
ORCID License
53.96 11
48 On the generic complexity of the searching graph isomorphism… (10.1515/gcc-2015-0015)
References ORCID License
52.42 4
49 Power-Commutative Nilpotent R-Powered Groups (10.1515/gcc.2009.297)
Abstract ORCID License
52.42 4
50 Using Decision Problems in Public Key Cryptography (10.1515/gcc.2009.33)
Abstract ORCID License
52.42 4