2019. 4th Issue

Volume XI, Number 4

Table of contents 

Full issue  (9,6 MB)



Vaclav (Vashek) Matyas, Pavol Zajac, Jan Hajny and Marek Sys
Special Issue on Cryptology – Guest Editorial 
This special issue brings selected papers from the 2019 Central European Conference on Cryptology, held in Telč, June 12-14, 2019.




Michal Andrzejczak and Wladyslaw Dudzic
SAT Attacks on ARX Ciphers with Automated Equations Generation 
We propose a novel and simple approach to algebraic attack on block ciphers with the SAT-solvers. As opposed to a standard approach, the equations for key expansion algorithms are not included in the formulas that are converted to satisfiability problem. The lack of equations leads to finding the solution much faster. The method was used to attack a lightweight block ciphers - SIMON and SPECK. We report the timings for roundreduced versions of selected ciphers and discuss the potential factors affecting the execution time of our attack.

DOI: 10.36244/ICJ.2019.4.1


Mithilesh Kumar, Havard Raddum, and Srimathi Varadharajan
Reducing Lattice Enumeration Search Trees  
We revisit the standard enumeration algorithm for finding the shortest vectors in a lattice, and study how the number of nodes in the associated search tree can be reduced. Two approaches for reducing the number of nodes are suggested. First we show that different permutations of the basis vectors have a big effect on the running time of standard enumeration, and give a class of permutations that give relatively few nodes in the search tree. This leads to an algorithm called hybrid enumeration that has a better running time than standard enumeration when the lattice is large. Next we show that it is possible to estimate the signs of the coefficients yielding a shortest vector, and that a pruning strategy can be based on this fact. Sign-based pruning gives fewer nodes in the search tree, and never missed the shortest vector in the experiments we did.

DOI: 10.36244/ICJ.2019.4.2


Pawel Augustynowicz and Krzysztof Kanciak
The search of square m-sequences with maximum period via GPU and CPU  
This paper deals with the efficient parallel search of square m-sequences on both modern CPUs and GPUs. The key idea is based on applying particular vector processor instructions with a view to maximizing the advantage of Single Instruction Multiple Data (SIMD) and Single Instruction Multiple Threads (SIMT) execution patterns. The developed implementation was adjusted to testing for the maximum-period of m-sequences of some particular forms. Furthermore, the early abort sieving strategy based on the application of SAT-solvers were presented. With this solution, it is possible to search m-sequences up to degree 32 exhaustively. 

DOI: 10.36244/ICJ.2019.4.3


Pavol Zajac, and Peter Spacek
A New Type of Signature Scheme Derived from a MRHS Representation of a Symmetric Cipher  
We propose a new concept of (post-quantum) digital signature algorithm derived from a symmetric cipher. Key derivation is based on a system of Multiple-Right-Hand-Sides equations. The source of the equations is the encryption algorithm. Our trapdoor is based on the difficulty of creating a valid transcript of the encryption algorithm for a given plaintext (derived from the signed message): the signer can use the encryption algorithm, because he knows the secret key, and the verifier can only check that the solution of the equation system is correct. To further facilitate the verification, we use techniques from coding theory. Security of the system is based on the difficulty of solving MRHS equations, or equivalently on the difficulty of the decoding problem (both are NP hard). 

DOI: 10.36244/ICJ.2019.4.4



Ádám Vécsi, Attila Bagossy, and Attila Pethő
Cross-platform Identity-based Cryptography using WebAssembly 
The explosive spread of the devices connected to the Internet has increased the need for efficient and portable cryptographic routines. Despite this fact, truly platformindependent implementations are still hard to find. In this paper, an Identitybased Cryptography library, called CryptID is introduced. The main goal of this library is to provide an efficient and opensource IBC implementation for the desktop, the mobile, and the IoT platforms. Powered by WebAssembly, which is a specification aiming to securely speed up code execution in various embedding environments, CryptID can be utilized on both the client and the server-side. The second novelty of CrpytID is the use of structured public keys, opening up a wide range of domain-specific use cases via arbitrary metadata embedded into the public key. Embedded metadata can include, for example, a geolocation value when working with geolocation-based Identitybased Cryptography, or a timestamp, enabling simple and efficient generation of singleuse keypairs. Thanks to these characteristics, we think, that CryptID could serve as a real alternative to the current Identitybased Cryptography implementations. 

DOI: 10.36244/ICJ.2019.4.5

Zakir Hussain, Asim ur Rehman Khan, Haider Mehdi and Aamir Ali
Performance Analysis of Communication System with Fluctuating Beckmann Fading 
In this paper, performance of device-to-device (D2D) communication system over Fluctuating Beckmann (FB) fading channels is analyzed. FB fading model is a novel generalized fading model that unifies various fading models such as Rayleigh, Nakagami, one-sided Gaussian, Rician, Rician shadowed, κ-μ, κ-μ shadowed, η-μ and Beckmann. The considered D2D system is assumed to be affected by various FB faded co-channel interferers. Using the characteristic function (CF) approach outage probability and success probability expressions are given. These expressions are functions of D2D and interference path-loss exponents, distance between the D2D devices, distances between interferers and the D2D receiver and, interference and D2D fading channel conditions. Maximum ratio combining (MRC) and selection combining (SC) based diversity schemes are considered to mitigate channel fading effects. D2D communication system under various conditions of channel fading and interference is numerically analyzed and discussed.

DOI: 10.36244/ICJ.2019.4.6

Sara El Gaily and Sándor Imre
Quantum Optimization of Resource Distribution Management for Multi-Task, Multi-Subtasks 
This paper proposes a new optimization strategy for resource distribution management based on a quantum algorithm, as a way to reduce the computational complexity in finding the optimum deployment scenario, taking into consideration the required conditions and constraints of the resource distribution system. We show that the quantum method computes the results in minimum time and outperforms on the other classical algorithms in terms of computational complexity.

DOI: 10.36244/ICJ.2019.4.7



43rd International Conference on Telecommunications and Signal Processing (TSP)
IEEE TSP 2020, Milan, Italy

International Conference on Sensors and Sensing Technologies
IEEE SENSORS 2020, Rotterdam, The Netherlands

28th European Signal Processing Conference
EUSIPCO 2020, Amsterdam, The Nertherlands



Guidelines for our Authors



Technical Co-Sponsors





National Cooperation Fund, Hungary