ISSN: 1862-2976

Journal Home

Journal Guideline

Journal of Mathematical Cryptology Q3 Unclaimed

Walter de Gruyter GmbH Germany

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

Journal of Mathematical Cryptology is a journal indexed in SJR in Applied Mathematics and Computer Science Applications with an H index of 21. It has an SJR impact factor of 0,338 and it has a best quartile of Q3. It has an SJR impact factor of 0,338.

Type: Journal

Type of Copyright:

Languages:

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Applied Mathematics (Q3) Computational Mathematics (Q3) Computer Science Applications (Q3)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

0,338

SJR Impact factor

21

H Index

19

Total Docs (Last Year)

57

Total Docs (3 years)

481

Total Refs

70

Total Cites (3 years)

56

Citable Docs (3 years)

1.08

Cites/Doc (2 years)

25.32

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Communications in Mathematics and Statistics Q3
Mathematical Modelling of Natural Phenomena Q3
Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica Q3
Mathematical and Computer Modelling of Dynamical Systems Q3
Annals of Mathematics and Artificial Intelligence Q3

Compare this journals

Aims and Scope

Best articles by citations

Cryptanalysis of an RSA variant with moduli N=prql

Cryptanalysis of three matrix-based key establishment protocols

An efficient identification protocol secure against concurrent-reset attacks

Time-memory trade-offs for index calculus in genus 3

A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage

On the concrete hardness of Learning with Errors

Generating pairing-friendly elliptic curve parameters using sparse families

On the density of some special primes

Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formul?¶

Subset sum pseudorandom numbers: fast generation and distribution

Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices

A subexponential construction of graph coloring for multiparty computation

SHOW MORE ARTICLES

Public key cryptosystem MST3: cryptanalysis and realization

Efficient computation of pairings on Jacobi quartic elliptic curves

Analysis of a key exchange protocol based on tropical matrix algebra

On hashing into elliptic curves

RSA: A number of formulas to improve the search for p + q p+q

Minimal weight expansions in Pisot bases

Rigorous upper bounds on data complexities of block cipher cryptanalysis

When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack

An exploration of affine group laws for elliptic curves

Another look at HMAC

Another look at non-standard discrete log and Diffie-Hellman problems

Compact McEliece keys based on quasi-dyadic Srivastava codes