Groups, Complexity, Cryptology

Aims & Scope

Cessation.

Groups – Complexity – Cryptology is a journal for speedy publication of articles in the areas of combinatorial and computational group theory, computer algebra, complexity theory, and cryptology.

Preference is given to papers that touch upon at least two of these areas, but strong papers representing just one of the areas are considered, too.

Groups – Complexity – Cryptology primarily publishes research papers, but comprehensive and timely survey articles on a topic inside the scope of the journal are also welcome.

All submitted papers are peer-reviewed before publication.

Topics Cryptology Combinatorial and computational group theory Computer algebra Complexity theory.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	0.3
2024	0.10

SJR (SCImago Journal Rank)

Year	Value
2024	0.125

Quartile

Year	Value
2024	Q4

h-index

Year	Value
2024	14

Journal Rank

Year	Value
2024	26825

Journal Citation Indicator

Year	Value
2024	9

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Licensing & Copyright

This journal operates under an Open Access model. Articles are freely accessible to the public immediately upon publication. The content is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0), allowing users to share and adapt the work with proper attribution.

Copyright remains with the author(s), and no permission is required for non-commercial use, provided the original source is cited.

---

APC Details

The journal’s Article Processing Charge (APC) policies support open access publishing in Computer Science and Mathematics, ensuring accessibility and quality in research dissemination.

This journal does not charge a mandatory Article Processing Charge (APC). However, optional open access publication may incur fees based on the publisher’s policies.

Explore journals without APCs for alternative publishing options.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Algorithmics on SLP-compressed strings: A survey

  Citation: 83

  Authors: Markus

• Public key exchange using matrices over group rings

  Citation: 45

  Authors: Delaram, Charalambos, Vladimir

• Isomorphism in expanding families of indistinguishable groups

  Citation: 27

  Authors: Mark L., James B.

• A Diffie–Hellman key exchange protocol using matrices over noncommutative rings

  Citation: 26

  Authors: Mohammad

• An update on Hurwitz groups

  Citation: 25

  Authors: Marston

• Equations over groups

  Citation: 22

  Authors: VitaliÄ­

• A linear decomposition attack

  Citation: 22

  Authors: Alexei, VitaliÄ­

• Algebraic attacks using SAT-solvers

  Citation: 17

  Authors: Philipp, Martin

• Existence, algorithms, and asymptotics of direct product decompositions, I

  Citation: 17

  Authors: James B.

• Groups with poly-context-free word problem

  Citation: 14

  Authors: Tara

---