journal: Journal of Mathematical Cryptology

Open Access Published since January 25, 2007

Journal of Mathematical Cryptology

ISSN: 1862-2984

Editor-in-chief: Massimiliano Sala

About this journal

------------------------------------------------

Promotion for Christmas and New Year

We offer a -75% discount on Article Processing Charges for manuscripts submitted till January 31, 2023.

------------------------------------------------

Objective
Journal of Mathematical Cryptology is a forum for original research articles in the area of mathematical cryptology. JMC is a fully peer-reviewed, open access, electronic-only journal publishing works of wide significance, originality and relevance. Works in the theory of cryptology and articles linking mathematics with cryptology (including quantum cryptology) are welcome. Submissions from all areas of mathematics significant for cryptology are invited, including but not limited to, algebra, algebraic geometry, coding theory, combinatorics, number theory, probability and stochastic processes

The scope includes mathematical results of algorithmic or computational nature that are of interest to cryptology. While JMC does not cover information security as a whole, the submission of manuscripts on information security with a strong mathematical emphasis is explicitly encouraged.

Topics

Boolean functions
Elliptic curve cryptography
Mathematical cryptology
Information security
Quantum cryptology
Algebra
Algebraic geometry
Coding theory
Combinatorics and graph theory
Number theory
Probability and stochastic processes
Work linking math to cryptology
Work in the mathematical foundations of crypto
Theoretical aspects of cryptology
Mathematical foundations of cryptology

Article formats
Original research articles

Information on Submission Process

Your Benefits

Authors benefit from critical peer review and promotion of published papers to readers and citers.
The journal uses a continuous publication model - accepted manuscripts are published quickly after acceptance.
Thanks to Open Access, all articles are freely available to the academic community worldwide without any restrictions. Authors also benefit from more liberal policies on copyrights (authors retain copyright) and on self-archiving (no embargo periods).
The journal is archived in Portico.

Publication fees

From June 1, 2022, articles accepted for publication in the Journal of Mathematical Cryptology are subject to Article Processing Charges (APCs). The publication fee amounts to 1000 EUR. Authors who have no funding for the submitted research can request a waiver or a discount during the submission process. For more details please check Article Processing Charges.

Abstracting and Indexing

Journal of Mathematical Cryptology is covered by the following services:

Baidu Scholar
Cabells Journalytics
Chronos Hub
CNKI Scholar (China National Knowledge Infrastructure)
CNPIEC - cnpLINKer
DBLP Computer Science Bibliography
Dimensions
DOAJ (Directory of Open Access Journals)
EBSCO (relevant databases)
EBSCO Discovery Service
Engineering Village
Genamics JournalSeek
Google Scholar
Inspec
Japan Science and Technology Agency (JST)
J-Gate
JournalGuide
JournalTOCs
KESLI-NDSL (Korean National Discovery for Science Leaders)
Mathematical Reviews (MathSciNet)
MyScienceWork
Naver Academic
Naviga (Softweco)
Norwegian Register for Scientific Journals, Series and Publishers
Primo Central (ExLibris)
ProQuest (relevant databases)
Publons
QOAM (Quality Open Access Market)
ReadCube
Reaxys
SCImago (SJR)
SCOPUS
Semantic Scholar
Sherpa/RoMEO
Summon (ProQuest)
TDNet
Ulrich's Periodicals Directory/ulrichsweb
WanFang Data
Web of Science - Emerging Sources Citation Index
WorldCat (OCLC)
X-MOL
Yewno Discover
zbMATH Open

Supplementary Materials

Topics

External Links

Volume 16 Issue 1

January 2022

Regular Articles

Open Access August 5, 2021

On the confusion coefficient of Boolean functions

Yu Zhou, Jianyong Hu, Xudong Miao, Yu Han, Fuzhong Zhang

Page range: 1-13

More Download PDF

Abstract

The notion of the confusion coefficient is a property that attempts to characterize confusion property of cryptographic algorithms against differential power analysis. In this article, we establish a relationship between the confusion coefficient and the autocorrelation function for any Boolean function and give a tight upper bound and a tight lower bound on the confusion coefficient for any (balanced) Boolean function. We also deduce some deep relationships between the sum-of-squares of the confusion coefficient and other cryptographic indicators (the sum-of-squares indicator, hamming weight, algebraic immunity and correlation immunity), respectively. Moreover, we obtain some trade-offs among the sum-of-squares of the confusion coefficient, the signal-to-noise ratio and the redefined transparency order for a Boolean function.

Open Access September 8, 2021

On the supersingular GPST attack

Andrea Basso, Fabien Pazuki

Page range: 14-19

More Download PDF

Abstract

The main attack against static-key supersingular isogeny Diffie–Hellman (SIDH) is the Galbraith–Petit–Shani–Ti (GPST) attack, which also prevents the application of SIDH to other constructions such as non-interactive key-exchange. In this paper, we identify and study a specific assumption on which the GPST attack relies that does not necessarily hold in all circumstances. We show that in some circumstances the attack fails to recover part of the secret key. We also characterize the conditions necessary for the attack to fail and show that it rarely happens in real cases. We give a link with collisions in the Charles-Goren-Lauter (CGL) hash function.

Open Access September 17, 2021

Reproducible families of codes and cryptographic applications

Paolo Santini, Edoardo Persichetti, Marco Baldi

Page range: 20-48

More Download PDF

Abstract

Structured linear block codes such as cyclic, quasi-cyclic and quasi-dyadic codes have gained an increasing role in recent years both in the context of error control and in that of code-based cryptography. Some well known families of structured linear block codes have been separately and intensively studied, without searching for possible bridges between them. In this article, we start from well known examples of this type and generalize them into a wider class of codes that we call ℱ-reproducible codes. Some families of ℱ-reproducible codes have the property that they can be entirely generated from a small number of signature vectors, and consequently admit matrices that can be described in a very compact way. We denote these codes as compactly reproducible codes and show that they encompass known families of compactly describable codes such as quasi-cyclic and quasi-dyadic codes. We then consider some cryptographic applications of codes of this type and show that their use can be advantageous for hindering some current attacks against cryptosystems relying on structured codes. This suggests that the general framework we introduce may enable future developments of code-based cryptography.

Open Access October 26, 2021

Evolution of group-theoretic cryptology attacks using hyper-heuristics

Matthew J. Craven, John R. Woodward

Page range: 49-63

More Download PDF

Abstract

In previous work, we developed a single evolutionary algorithm (EA) to solve random instances of the Anshel–Anshel–Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings. The present work extends this by exploring the use of hyper-heuristics in group-theoretic cryptology for the first time. Hyper-heuristics are a way to generate new algorithms from existing algorithm components (in this case, simple heuristics), with EAs being one example of the type of algorithm which can be generated by our hyper-heuristic framework. We take as a starting point the above EA and allow hyper-heuristics to build on it by making small tweaks to it. This adaptation is through a process of taking the EA and injecting chains of heuristics built from the simple heuristics. We demonstrate we can create novel heuristic chains, which when placed in the EA create algorithms that out perform the existing EA. The new algorithms solve a greater number of random AAG instances than the EA. This suggests the approach may be applied to many of the same kinds of problems, providing a framework for the solution of cryptology problems over groups. The contribution of this article is thus a framework to automatically build algorithms to attack cryptology problems given an applicable group.

Open Access January 7, 2022

MAKE: A matrix action key exchange

Nael Rahman, Vladimir Shpilrain

Page range: 64-72

More Download PDF

Abstract

We offer a public key exchange protocol based on a semidirect product of two cyclic (semi)groups of matrices over Z p {{\mathbb{Z}}}_{p} . One of the (semi)groups is additive, and the other one is multiplicative. This allows us to take advantage of both operations on matrices to diffuse information. We note that in our protocol, no power of any matrix or of any element of Z p {{\mathbb{Z}}}_{p} is ever exposed, so standard classical attacks on Diffie–Hellman-like protocols are not applicable.

Open Access January 28, 2022

The mF mode of authenticated encryption with associated data

Bishwajit Chakraborty, Mridul Nandi

Page range: 73-97

More Download PDF

Abstract

In recent years, the demand for lightweight cryptographic protocols has grown immensely. To fulfill this necessity, the National Institute of Standards and Technology (NIST) has initiated a standardization process for lightweight cryptographic encryption. NIST’s call for proposal demands that the scheme should have one primary member that has a key length of 128 bits, and it should be secure up to 2 50 − 1 {2}^{50}-1 byte queries and 2 112 {2}^{112} computations. In this article, we propose a tweakable block cipher (TBC)-based authenticated encryption with associated data (AEAD) scheme, which we call mF {\mathsf{mF}} . We provide authenticated encryption security analysis for mF {\mathsf{mF}} under some weaker security assumptions (stated in the article) on the underlying TBC. We instantiate a TBC using block cipher and show that the TBC achieves these weaker securities, provided the key update function has high periodicity. mixFeed {\mathsf{mixFeed}} is a round 2 candidate in the aforementioned lightweight cryptographic standardization competition. When we replace the key update function with the key scheduling function of Advanced Encryption Standard (AES), the mF {\mathsf{mF}} mode reduces to mixFeed {\mathsf{mixFeed}} . Recently, the low periodicity of AES key schedule is shown. Exploiting this feature, a practical attack on mixFeed {\mathsf{mixFeed}} is reported. We have shown that multiplication by primitive element satisfies the high periodicity property, and we have a secure instantiation of mF {\mathsf{mF}} , a secure variant of mixFeed {\mathsf{mixFeed}} .

Open Access February 10, 2022

Cryptanalysis of “MAKE”

Daniel R. L. Brown, Neal Koblitz, Jason T. LeGrow

Page range: 98-102

More Download PDF

Abstract

Rahman and Shpilrain proposed a Diffie–Hellman style key exchange based on a semidirect product of n × n n\times n -matrices over a finite field. We show that, using public information, an adversary can recover the agreed upon secret key by solving a system of n 2 {n}^{2} linear equations.

Open Access June 9, 2022

An efficient post-quantum KEM from CSIDH

Mingping Qi

Page range: 103-113

More Download PDF

Abstract

The SIDH and CSIDH are now the two most well-known post-quantum key exchange protocols from the supersingular isogeny-based cryptography, which have attracted much attention in recent years and served as the building blocks of other supersingular isogeny-based cryptographic schemes. The famous SIKE is a post-quantum key encapsulation mechanism (KEM) constructed on the SIDH, motivated by which, this article presents a new post-quantum KEM-based on the CSIDH, which is thereby named as CSIKE. The presented CSIKE has much higher computation efficiency in the decapsulation part by involving an additional tag in the encapsulation results. The new CSIKE is formally proved to be IND-CCA secure under the standard isogeny-based quantum resistant security assumption. Moreover, by comparing the new CSIKE with the only two existing CSIDH-based KEM schemes, i.e., CSIDH-PSEC-KEM and CSIDH-ECIES-KEM, it can be easily found that the new CSIKE has a slightly longer encapsulation size than CSIDH-PSEC-KEM and CSIDH-ECIES-KEM, but (i) it beats the CSIDH-PSEC-KEM by the improvement of approximately 50% in decapsulation speed, and (ii) it has a certain advantage over the CSIDH-ECIES-KEM in security since in the random oracle model, the security proof for CSIDH-ECIES-KEM needs to rely on the stronger CSI-GDH assumption, while the new CSIKE just needs to rely on the basic CSI-CDH assumption.

Open Access June 13, 2022

Pseudo-free families and cryptographic primitives

Mikhail Anokhin

Page range: 114-140

More Download PDF

Abstract

In this article, we study the connections between pseudo-free families of computational Ω \Omega -algebras (in appropriate varieties of Ω \Omega -algebras for suitable finite sets Ω \Omega of finitary operation symbols) and certain standard cryptographic primitives. We restrict ourselves to families ( H d ∣ d ∈ D ) \left({H}_{d}\hspace{0.33em}| \hspace{0.33em}d\in D) of computational Ω \Omega -algebras (where D ⊆ { 0 , 1 } ∗ D\subseteq {\left\{0,1\right\}}^{\ast } ) such that for every d ∈ D d\in D , each element of H d {H}_{d} is represented by a unique bit string of the length polynomial in the length of d d . Very loosely speaking, our main results are as follows: (i) pseudo-free families of computational mono-unary algebras with one to one fundamental operation (in the variety of all mono-unary algebras) exist if and only if one-way families of permutations exist; (ii) for any m ≥ 2 m\ge 2 , pseudo-free families of computational m m -unary algebras with one to one fundamental operations (in the variety of all m m -unary algebras) exist if and only if claw resistant families of m m -tuples of permutations exist; (iii) for a certain Ω \Omega and a certain variety V {\mathfrak{V}} of Ω \Omega -algebras, the existence of pseudo-free families of computational Ω \Omega -algebras in V {\mathfrak{V}} implies the existence of families of trapdoor permutations.

Open Access July 1, 2022

A deterministic algorithm for the discrete logarithm problem in a semigroup

Simran Tinani, Joachim Rosenthal

Page range: 141-155

More Download PDF

Abstract

The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have a time complexity of O ( N log N ) O\left(\sqrt{N}\log N) and a space complexity of O ( N ) O\left(\sqrt{N}) , where N N is the order of the group. (If N N is unknown, a simple modification would achieve a time complexity of O ( N ( log N ) 2 ) O\left(\sqrt{N}{\left(\log N)}^{2}) .) These algorithms require the inversion of some group elements or rely on finding collisions and the existence of inverses, and thus do not adapt to work in the general semigroup setting. For semigroups, probabilistic algorithms with similar time complexity have been proposed. The main result of this article is a deterministic algorithm for solving the DLP in a semigroup. Specifically, let x x be an element in a semigroup having finite order N x {N}_{x} . The article provides an algorithm, which, given any element y ∈ ⟨ x ⟩ y\in \langle x\rangle , provides all natural numbers m m with x m = y {x}^{m}=y , and has time complexity O ( N x ( log N x ) 2 ) O\left(\sqrt{{N}_{x}}{\left(\log {N}_{x})}^{2}) steps. The article also gives an analysis of the success rates of the existing probabilistic algorithms, which were so far only conjectured or stated loosely.

Open Access July 1, 2022

Application of automorphic forms to lattice problems

Samed Düzlü, Juliane Krämer

Page range: 156-197

More Download PDF

Abstract

In this article, we propose a new approach to the study of lattice problems used in cryptography. We specifically focus on module lattices of a fixed rank over some number field. An essential question is the hardness of certain computational problems on such module lattices, as the additional structure may allow exploitation. The fundamental insight is the fact that the collection of those lattices are quotients of algebraic manifolds by arithmetic subgroups. Functions in these spaces are studied in mathematics as part of the number theory. In particular, those form a module over the Hecke algebra associated with the general linear group. We use results on these function spaces to define a class of distributions on the space of lattices. Using the Hecke algebra, we define Hecke operators associated with collections of prime ideals of the number field and show a criterion on distributions to converge to the uniform distribution, if the Hecke operators are applied to the chosen distribution. Our approach is motivated by the work of de Boer, Ducas, Pellet-Mary, and Wesolowski (CRYPTO’20) on self-reduction of ideal lattices via Arakelov divisors.

Open Access July 15, 2022

On the algebraic immunity of multiplexer Boolean functions

Prasanna R. Mishra, Shashi Kant Pandey

Page range: 198-204

More Download PDF

Abstract

A multiplexer generator is a device that accepts two or more inputs and based on some logic sends one of them as output. In a special case when inputs to a multiplexer generator are 2 k {2}^{k} bits and one of them is selected according to the value of a k k -bit number, a multiplexer generator can be regarded as a Boolean function in 2 k + k {2}^{k}+k variables. We call this generator a multiplexer Boolean function. Boolean functions serve as combiners and filters in cryptographic designs. The study of their cryptographic strength attracts the cryptographer because of the extremely simple and cost effective of their design. The study of algebraic attacks on multiplexer generators is another major concern to judging the suitability for its use in cryptographic designs. In this article, we calculate the algebraic immunity of the multiplexer Boolean function, which is not an obvious task in the case of a Boolean function like a multiplexer generator.

Open Access August 5, 2022

A Ring-LWE-based digital signature inspired by Lindner–Peikert scheme

Javad Sharafi, Hassan Daghigh

Page range: 205-214

More Download PDF

Abstract

In this article, we give a digital signature by using Lindner–Peikert cryptosystem. The security of this digital signature is based on the assumptions about hardness of Ring-LWE and Ring-SIS problems, along with providing public key and signature of compact (1–1.5 kilobytes) size. We prove the security of our signature scheme in the Quantum Random Oracle Model. Our cryptanalysis has been done based on methods of Aggarwal et al. and Chen et al.

Open Access August 10, 2022

The polynomial learning with errors problem and the smearing condition

Liljana Babinkostova, Ariana Chin, Aaron Kirtland, Vladyslav Nazarchuk, Esther Plotnick

Page range: 215-232

More Download PDF

Abstract

As quantum computing advances rapidly, guaranteeing the security of cryptographic protocols resistant to quantum attacks is paramount. Some leading candidate cryptosystems use the learning with errors (LWE) problem, attractive for its simplicity and hardness guaranteed by reductions from hard computational lattice problems. Its algebraic variants, ring-learning with errors (RLWE) and polynomial learning with errors (PLWE), gain efficiency over standard LWE, but their security remains to be thoroughly investigated. In this work, we consider the “smearing” condition, a condition for attacks on PLWE and RLWE introduced in Elias et al. We expand upon some questions about smearing posed by Elias et al. and show how smearing is related to the coupon collector’s problem. Furthermore, we develop an algorithm for computing probabilities related to smearing. Finally, we present a smearing-based algorithm for solving the PLWE problem.

Open Access August 17, 2022

Abelian sharing, common informations, and linear rank inequalities

Carolina Mejia, Juan Andres Montoya

Page range: 233-250

More Download PDF

Abstract

Dougherty et al. introduced the common information (CI) method as a method to produce non-Shannon inequalities satisfied by linear random variables, which are called linear rank inequalities. This method is based on the fact that linear random variables have CI. Dougerthy et al. asked whether this method is complete, in the sense that it can be used to produce all linear rank inequalities. We study this question, and we attack it using the theory of secret sharing schemes. To this end, we introduce the notions of Abelian secret sharing scheme and Abelian capacity. We prove that: If there exists an access structure whose Abelian capacity is smaller than its linear capacity, then the CI method is not complete. We investigate the existence of such an access structure.

Open Access August 18, 2022

Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting

Srinivas Vivek, Shyam Murthy, Deepak Kumaraswamy

Page range: 251-277

More Download PDF

Abstract

We investigate the problem of recovering integer inputs (up to an affine scaling) when given only the integer monotonic polynomial outputs. Given n n integer outputs of a degree- d d integer monotonic polynomial whose coefficients and inputs are integers within known bounds and n ≫ d n\gg d , we give an algorithm to recover the polynomial and the integer inputs (up to an affine scaling). A heuristic expected time complexity analysis of our method shows that it is exponential in the size of the degree of the polynomial but polynomial in the size of the polynomial coefficients. We conduct experiments with real-world data as well as randomly chosen parameters and demonstrate the effectiveness of our algorithm over a wide range of parameters. Using only the polynomial evaluations at specific integer points, the apparent hardness of recovering the input data served as the basis of security of a recent protocol proposed by Kesarwani et al. for secure k k -nearest neighbor computation on encrypted data that involved secure sorting. The protocol uses the outputs of randomly chosen monotonic integer polynomial to hide its inputs except to only reveal the ordering of input data. By using our integer polynomial recovery algorithm, we show that we can recover the polynomial and the inputs within a few seconds, thereby demonstrating an attack on the protocol of Kesarwani et al.

Open Access October 17, 2022

DLP in semigroups: Algorithms and lower bounds

Jiao Han, Jincheng Zhuang

Page range: 278-288

More Download PDF

Abstract

The discrete logarithm problem (DLP) in semigroups has attracted some interests and serves as the foundation of many cryptographic schemes. In this work, we study algorithms and lower bounds for DLP in semigroups. First, we propose a variant of the deterministic algorithm for solving the cycle length of torsion elements and show the lower bound of computing the DLP in a semigroup. Then, we propose an algorithm for solving the multiple discrete logarithm (MDL) problem in the semigroup and give the lower bound for solving the MDL problem by considering the MDL problem in the generic semigroup model. Besides, we solve the multidimensional DLP and product DLP in the semigroup.

Open Access November 23, 2022

On the efficiency of a general attack against the MOBS cryptosystem

Christopher Battarbee, Delaram Kahrobaei, Dylan Tailor, Siamak F. Shahandashti

Page range: 289-297

More Download PDF

Abstract

All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman key exchange protocol, satisfy the so-called telescoping equality; in some cases, this equality has been used to construct an attack. In this report, we present computational evidence suggesting that an instance of the scheme called “MOBS (matrices over bitstrings)” is an example of a scheme where the telescoping equality has too many solutions to be a practically viable means to conduct an attack.

Volume 13 (2019)

Volume 12 (2018)

Volume 11 (2017)

Volume 10 (2016)

Volume 9 (2015)

Volume 8 (2014)

Volume 7 (2013)

Volume 6 (2012)

Volume 5 (2011)

Volume 4 (2010)

Volume 3 (2009)

Volume 2 (2008)

Volume 1 (2007)

Cite Score	1.0
Journal Citation Indicator	0.14
Mathematical Citation Quotient	0.16
SCImago Journal Rank	0.221
Source Normalized Impact per Paper	0.677

Submit

Submission
Please submit to JMC via ScholarOne Manuscripts　

Your benefits of publishing with us

Authors benefit from critical peer review and promotion of published papers to readers and citers.
The journal uses a continuous publication model - accepted manuscripts are published quickly after acceptance.
Thanks to Open Access, all articles are freely available to the academic community worldwide without any restrictions. Authors also benefit from more liberal policies on copyrights (authors retain copyright) and on self-archiving (no embargo periods).
The journal is archived in Portico.

Submission process

Before submitting an article, please adhere to the Instructions for Authors (Supplementary Information)
Submission of your paper via ScholarOne Manuscripts
Peer review procedure
Decision on your paper
Publishing
You will be guided through the whole process of submission
In case of any problems editorial assistance will be provided

Please note

Before submitting your manuscript, please get familiar with Publication ethics and malpractice statement
Beginning from January 2020, JMC is publishing in the Open Access model
Online publication for all papers accepted after peer review
If you have any general questions please visit our FAQ page for authors

We look forward to receiving your manuscript!

EDITORIAL POLICY

Unpublished material
Submission of a manuscript implies that the work described is not copyrighted, published or submitted elsewhere, except in abstract form. The corresponding author should ensure that all authors approve the manuscript before its submission.

Conflict of interest
When authors submit a manuscript, they are responsible for recognizing and disclosing financial and/or other conflicts of interest that might bias their work and/or could inappropriately influence his/her judgment. If no specified acknowledgement is given, the Editors assume that no conflict of interest exists.

Copyright
All authors retain copyright, unless – due to their local circumstances – their work is not copyrighted. The copyrights are governed by the Creative-Commons Attribution Only license (CC-BY) which is compliant with Plan-S. We may also publish a paper under CC-BY-NC-ND license on author's request. The corresponding author grants the journal license for use of the article, by signing the License To Publish. Scanned copy of license should be sent to the journal, as soon as possible.

Authorship
Authorship should be limited to those who have made a significant contribution to the conception, design, execution, or interpretation of the reported study. All those who have made significant contributions should be listed as coauthors. Where there are others who have participated in certain substantive aspects of the research project, they should be named in an Acknowledgement section.

Peer Review process
The Editors reserve the right to decline the submitted manuscript without review, if the studies reported are not sufficiently novel or important to merit publication in the journal. Manuscripts deemed unsuitable (insufficient originality or of limited interest to the target audience) are returned to the author(s) without review. The Editor seeks advice from experts in the appropriate field. Research articles and communications are refereed by a minimum of two reviewers, review papers by at least three. The journal uses single-blind peer review model. Authors are requested to suggest persons competent to review their manuscript. However, please note that this will be treated only as a suggestion, and the final selection of reviewers is exclusively the Editor’s decision. Suggested reviewers must not include authors’ students, mentors, collaborators, or others who have conflicts of interest. The final decision of acceptance is made by the main Editor of the journal.

Data sharing policy
Effective January 2021, the journal requires authors to follow data sharing policy. Research data should be made widely available to the research community in order to demonstrate the robustness and validity of the research presented in the journal, to encourage replication of the results, and to provide the community with opportunities to learn. By publishing in the journal authors are required to provide a data availability statement (DAS) in their articles. Authors are encouraged to share their data but not required to. The decision to publish will not be affected by whether or not authors share their research data.

Scientific Misconduct
This journal publishes only original manuscripts that are not also published or going to be published elsewhere. Multiple submissions/publications, or redundant publications (re-packaging in different words of data already published by the same authors) will be rejected. If they are detected only after publication, the journal reserves the right to publish a Retraction Note. In each particular case Editors will follow COPE’s Code of Conduct and implement its advice.

Editorial

Editor-in-Chief
Massimiliano Sala, Department of Mathematics, University of Trento, Italy

Honorary Editor-in-Chief
Nicolas Courtois, University College London, UK

Editorial Advisory Board
Timothy J. Hodges, University of Cincinnati, USA
Wasim Alhamdani, School of Computer and Information Sciences, University of the Cumberlands, KY, USA
Lejla Batina, Institute for Computing and Information Sciences, Radboud University, The Netherlands
Joseph J. Boutros, Texas A&M University at Qatar, Doha, Qatar
Ray CC Cheung, City University of Hong Kong, Hong Kong
Bernardo David, IT-Universitetet i København, Copenhagen, Denmark
Roberto De Prisco, Università di Salerno, Salerno, Italy
Vipul Goyal, Carnegie Mellon University, Pittsburgh, USA
Shay Gueron, University of Haifa and Intel Corporation, Israel
Chunlei Li, Department of Informatics, University of Bergen, Norway
Carlos Aguilar Melchor, ISAE-SUPAERO, Toulouse University, France
Dominique Schröder, Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
Gil Segev, School of Computer Science and Engineering, Hebrew University of Jerusalem
Susanne Wetzel, Stevens Institute of Technology, Department of Computer Science, Castle Point on Hudson, USA
Øyvind Ytrehus, Simula UiB AS, Norway
Chao Zhang, School of Mathematics, Harbin Institute of Technology, China

Editorial Board
Paolo D'Arco, Università di Salerno, Salerno, Italy
Andrej Dujella, University of Zagreb, Croatia
Delaram Kahrobaei, City University of New York, USA
Barbara Masucci, Dipartimento di Informatica, Università di Salerno, Italy
Wai Ho Mow, Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Hong Kong
David Naccache, École Normale Supérieure, France
Daniel Panario, School of Mathematics and Statistics, Carleton University, Canada
Juha Partala, University of Oulu, Finland
Jacques Patarin, University of Versailles, France
Federico Pintore, University of Bari, Italy
Jean-Jacques Quisquater, Université Catholique de Louvain (UCL), Belgium
Dmytro Savchuk, Department of Mathematics and Statistics, University of South Florida, USA
Vladimir Shpilrain, University of New York, USA
Tamir Tassa, Department of Mathematics and Computer Science, The Open University of Israel, Israel
Huaxiong Wang, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore

Editorial Contact
Monika Maleszka
jmc_editorial@degruyter.com

(Deutsch)

Type: Journal
Language: English
Publisher: De Gruyter
First published: January 25, 2007
Publication Frequency: 1 Issue per Year
Audience: All those interested in selected areas lying at the crossroads of mathematics and cryptology.