Faster Ate pairing computation on Selmer's model of elliptic curves

Objective
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.

• Cryptology
• Combinatorial and computational group theory
• Computer algebra
• Complexity theory

Article formats
Editorials, Research Papers, Survey Articles

> Information on the submission process