Cryptographic Research Research Articles

Systematic literature review: comparison study of symmetric key and asymmetric key algorithm

Cryptography is a science that studies how to keep data or messages safe when sent, from sender to recipient without interference from third parties. This paper presents a comparison of cryptographic algorithms of simetris keys and asymmetric keys. Cryptographic research related journals are collected and analyzed to find the correct comparison of cryptographic algorithms to implement. The results of this study, namely: symmetric and asymmetric keys have differences in the process of encryption and decryption. There are many cryptographic algorithms that can be applied to symmetric and asymmetric keys, but the selection and use of certain algorithms cannot be said to be forever the best because they depend on the circumstances encountered in developing the applied system.

Still wrong use of pairings in cryptography

Recently many pairing-based cryptographic protocols have been designed with a wide variety of new novel applications including the ones in the emerging technologies like cloud computing, internet of things (IoT), e-health systems, and wearable technologies. There have been, however, a wide range of incorrect use of these primitives mainly because of their use in a “black-box” manner. Some new attacks on the discrete logarithm problem lead to either totally insecure or highly inefficient pairing-based protocols, and extend considerably the issues related to pairings originally pointed out by Galbraith et al. (2008). Other reasons are the implementation attacks, the minimal embedding field attacks, and the issues due to the existence of auxiliary inputs. Although almost all these issues are well-known to mathematical cryptographers, there is no state-of-the-art assessment covering all these new issues which could be used by the applied cryptography researchers and the IT-security developers. In order to illustrate this point, we give a list of recent papers having either wrong security assumptions or realizability/efficiency issues. Furthermore, we give a compact and an state-of-the-art recipe of the correct use of pairings for the correct design with a view towards efficient and secure implementation of security solutions using these primitives.

Quantum polynomial-time fixed-point attack for RSA

Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits deep research to protect against new types of attacks. It is therefore highly meaningful to research cryptanalysis in the quantum computing environment. Shor proposed a well-known factoring algorithm by finding the prime factors of a number n = pq, which is exponentially faster than the best known classical algorithm. The idea behind Shor's quantum factoring algorithm is a straightforward programming consequence of the following proposition: to factor n, it suffices to find the order r; once such an r is found, one can compute gcd(a <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r/2</sup> ± 1, n) = p or q. For odd values of r it is assumed that the factors of n cannot be found (since a <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r/2</sup> is not generally an integer). That is, the order r must be even. This restriction can be removed, however, by working from another angle. Based on the quantum inverse Fourier transform and phase estimation, this paper presents a new polynomial-time quantum algorithm for breaking RSA, without explicitly factoring the modulus n. The probability of success of the new algorithm is greater than 4φ(r)/π <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> r, exceeding that of the existing quantum algorithm for attacking RSA based on factorization. In constrast to the existing quantum algorithm for attacking RSA, the order r of the fixed point C for RSA does not need to be even. It changed the practices that cryptanalysts try to recover the private-key, directly from recovering the plaintext M to start, a ciphertext-only attack attacking RSA is proposed.

Examination of China's performance and thematic evolution in quantum cryptography research using quantitative and computational techniques.

This study performed two phases of analysis to shed light on the performance and thematic evolution of China’s quantum cryptography (QC) research. First, large-scale research publication metadata derived from QC research published from 2001–2017 was used to examine the research performance of China relative to that of global peers using established quantitative and qualitative measures. Second, this study identified the thematic evolution of China’s QC research using co-word cluster network analysis, a computational science mapping technique. The results from the first phase indicate that over the past 17 years, China’s performance has evolved dramatically, placing it in a leading position. Among the most significant findings is the exponential rate at which all of China’s performance indicators (i.e., Publication Frequency, citation score, H-index) are growing. China’s H-index (a normalized indicator) has surpassed all other countries’ over the last several years. The second phase of analysis shows how China’s main research focus has shifted among several QC themes, including quantum-key-distribution, photon-optical communication, network protocols, and quantum entanglement with an emphasis on applied research. Several themes were observed across time periods (e.g., photons, quantum-key-distribution, secret-messages, quantum-optics, quantum-signatures); some themes disappeared over time (e.g., computer-networks, attack-strategies, bell-state, polarization-state), while others emerged more recently (e.g., quantum-entanglement, decoy-state, unitary-operation). Findings from the first phase of analysis provide empirical evidence that China has emerged as the global driving force in QC. Considering China is the premier driving force in global QC research, findings from the second phase of analysis provide an understanding of China’s QC research themes, which can provide clarity into how QC technologies might take shape. QC and science and technology policy researchers can also use these findings to trace previous research directions and plan future lines of research.

Agile cryptographic solutions for the cloud

Cloud computing, with its estimated market size of 150 billion USD annual turnover, is one of the major growth areas in information and communication technologies today. As a paradigm building on outsourcing of storage and processing, cloud computing suffers from intrinsic security and privacy problems. However, cryptographic research has made substantial progress over the last years and today provides a portfolio of mature cryptographic primitives and protocols suitable for addressing several of these problems in an effective and efficient way. Nevertheless, today’s reality shows that there exists a gap between what is possible and what is actually available in the cloud. We will present a detailed analysis of inhibitors and roadblocks standing in the way of an extensive deployment of cryptographic protection to cloud services, and how organizational and procedural measures may support the practical deployment of cryptography. We conclude our article with an overview of novel cryptographic schemes and their potential for protection of end-user data during storage and processing in the cloud, once they will become widely available.

Continuous leakage-resilient certificateless public key encryption with CCA security

Recently, much attention has been focused on designing provably secure cryptographic scheme in the presence of key leakage, and many constructions are proposed by cryptography researchers. However, most of them are researched in the bounded-leakage model, and cannot keep their claimed security in the continuous-leakage setting. It has been a research challenge to achieve the claimed security in continuous leakage setting. Also, for any polynomial time adversary, most of pre-existing constructions cannot ensure that their output is random in the leakage setting, and any adversary can get a certain amount of additional information on the private key from the output of cryptographic scheme. To obtain better performance (e.g., continuous leakage-resilience, etc.), a new construction of CCA2 secure continuous leakage-resilient certificateless public-key encryption scheme is proposed in this paper, and the scheme’s security is proved based on the hardness of the classical decisional Diffie–Hellman assumption. According to the results of analysis, we can get that our construction not only tolerates continuous leakage attacks on the private key through periodically update, but also enjoys better performances, such as the round leakage parameter has the constant size, and any polynomial time adversary are unable to get leakage on the private key from the corresponding ciphertext, etc. In particular, the striking advantage of our method is the key leakage ratio, which can achieve 3/4. Because these good performance features, our proposal may have some significant value in the practical applications.

Evolutionary cryptography theory-based generating method for secure ECs

Ant Colony Optimization (ACO) has the character of positive feedback, distributed searching, and greedy searching. It is applicable to optimization grouping problems. Traditional cryptographic research is mainly based on pure mathematical methods which have complicated theories and algorithm. It seems that there is no relationship between cryptography and ACO. Actually, some problems in cryptography are due to optimization grouping problems that could be improved using an evolutionary algorithm. Therefore, this paper presents a new method of solving secure curve selection problems using ACO. We improved Complex Multiplication (CM) by combining Evolutionary Cryptography Theory with Weber polynomial solutions. We found that ACO makes full use of valid information generated from factorization and allocates computing resource reasonably. It greatly increases the performance of Weber polynomial solutions. Compared with traditional CM, which can only search one root once time, our new method searches all roots of the polynomial once, and the average time needed to search for one root reduces rapidly. The more roots are searched, the more ECs are obtained.

New Approach of the Playfair's Cipher with A Numerical Value of the Keyword

&lt;p&gt;At least during the last five years there has been an explosion of a public academic research in cryptography for Playfair's cipher. We were interested, and we have proposed a method to improve it, to make it safer and more efficient. We have oversized this encryption matrix by 7x7 coefficents and for its filling, we have combined two chaotic maps (the attractor Henon and logistics map). The attractor Henon of dimension 2, determines the intersection of the row and column of the new matrix playfair. The coefficients of this matrix are calculated from logistic map, each value is a single character of the alphabet used. The secret keyword is formed by the initial conditions of the chaotic attractors.&lt;/p&gt;

Code wars

Quantum cryptography gears up to fight code-breaking quantum computers. Will the approach bolster security in the future, or is it fatally flawed? In October 2014, an Antares rocket blasted off from a NASA launch pad on one of Virginia’s barrier islands, and exploded seconds later. In addition to about 5,000 pounds of food and equipment destined for the International Space Station, the doomed rocket was carrying 26 miniature satellites called CubeSats, one of which housed physicist Alexander Ling’s experiment. “We thought, ‘oh, that’s it, we’re not going to see our experiment again,’” recalls Ling, of the Centre for Quantum Technologies in Singapore. He was mistaken. Advances in quantum cryptography could enable the creation of a global quantum Internet. It would consist of networks on the ground, as well as in space, set up via satellites capable of exchanging photons in fragile quantum states. Image courtesy of Shutterstock/Login. Days later, Ling got a phone call. His experiment had washed up on a nearby beach. The CubeSat’s metal casing had been crushed—“a bit,” says Ling, but the experiment inside had not only survived but was still working. The nature of the experiment made this even more astonishing: Their device used crystals and lasers to generate particles of light, or photons, in delicate, easily destroyed quantum states. Neither the turbulence of the launch nor the shock of the explosion had knocked the device out of alignment. Ling was ecstatic. Although the mission had failed, his experiment had endured. He and other quantum cryptography researchers hope that expectations about the technology’s potential hold up just as well. Ling wants to help build a global quantum Internet in which computers would communicate securely using the quantum mechanical properties of particles of light. Such an effort would require both networks on the ground, built over existing …

全球量子密码专利分析

随着互联网信息技术日新月异的发展以及量子时代的不断迫近，各国对量子密码及量子通信领域研究的重视程度越来越高。量子密码专利数据可以很好地反映一个国家量子密码领域的进展与成果，进而揭示国家相关的科技实力和国防力量。本文分别从专利申请时间、专利申请机构、国际专利分类表(IPC分类)三方面切入，对2000年到2017年全球四大主要量子研发地区美国、欧盟、日本和中国的专利申请情况进行详细的分析研究，归纳各国量子密码领域的研究成果并预测各国研究热点趋势。这不仅为分析国家的科技实力提供了直观详实的数据支撑，而且在全球量子科技发展的深层次探索和国家的量子战略规划等方面具有重要的参考价值。 With the rapid development of Internet based on information technology and the approach of the quantum age, countries pay more and more attention to the research of quantum cryptography and quantum communication. The quantum cryptography patent data can well reflect the pro- gress and achievement in quantum cryptography field of a country, which reveals the relevant scientific and technological strength and national defense strength of a country. This paper makes a detailed analysis of patent applications from 2000 to 2017 in four major quantum research and development regions in the world, namely the United States, the European Union, Japan and China. The analysis is carried out from three aspects of patent application time, patent application organization and patent classification number. And then the research results in quantum cryptography field of the countries above are summarized and the research trends are predicted. These provide an intuitive and detailed data support for the analysis of a country’s scientific and technological strength. Moreover, it can be an important reference for further research on developments of global quantum technology and the national quantum strategic planning.

Special Issue on Entropy-Based Applied Cryptography and Enhanced Security for Ubiquitous Computing

Entropy is a basic and important concept in information theory. It is also often used as a measure of the unpredictability of a cryptographic key in cryptography research areas. Ubiquitous computing (Ubi-comp) has emerged rapidly as an exciting new paradigm. In this special issue, we mainly selected and discussed papers related with ore theories based on the graph theory to solve computational problems on cryptography and security, practical technologies; applications and services for Ubi-comp including secure encryption techniques, identity and authentication; credential cloning attacks and countermeasures; switching generator with resistance against the algebraic and side channel attacks; entropy-based network anomaly detection; applied cryptography using chaos function, information hiding and watermark, secret sharing, message authentication, detection and modeling of cyber attacks with Petri Nets, and quantum flows for secret key distribution, etc.

Embedding cryptographic features in compressive sensing

Compressive sensing (CS) has been widely studied and applied in many fields. Recently, the way to perform secure compressive sensing (SCS) has become a topic of growing interest. The existing works on SCS usually take the sensing matrix as a key and can only be considered as preliminary explorations on SCS. In this paper, we firstly propose some possible encryption models for CS. It is believed that these models will provide a new point of view and stimulate further research in both CS and cryptography. Then, we demonstrate that random permutation is an acceptable permutation with overwhelming probability, which can effectively relax the Restricted Isometry Constant for parallel compressive sensing. Moreover, random permutation is utilized to design a secure parallel compressive sensing scheme. Security analysis indicates that the proposed scheme can achieve the asymptotic spherical secrecy. Meanwhile, the realization of chaos is used to validate the feasibility of one of the proposed encryption models for CS. Lastly, results verify that the embedding random permutation based encryption enhances the compression performance and the scheme possesses high transmission robustness against additive white Gaussian noise and cropping attack.

Computational aspects of correlation power analysis

Since the discovery of simple power attacks, the cryptographic research community has developed significantly more advanced attack methods. The idea behind most algorithms remains to perform a statistical analysis by correlating the power trace obtained when executing a cryptographic primitive to a key-dependent guess. With the advancements of cryptographic countermeasures, it is not uncommon that sophisticated (higher order) power attacks require computation on many millions of power traces to find the desired correlation. In this paper, we study the computational aspects of calculating the most widely used correlation coefficient: the Pearson product-moment correlation coefficient. We study various time–memory trade-off techniques which apply specifically to the cryptologic setting and present methods to extend already completed computations using incremental versions. Moreover, we show how this technique can be applied to second-order attacks, reducing the attack cost significantly when adding new traces to an existing dataset. We also present methods which allow one to split the potentially huge trace set into smaller, more manageable chunks to reduce the memory requirements. Our parallel implementation of these techniques highlights the benefits of this approach as it allows efficient computations on power measurements consisting of hundreds of gigabytes on a single modern workstation.

Leakage assessment methodology

Evoked by the increasing need to integrate side-channel countermeasures into security-enabled commercial devices, evaluation labs are seeking a standard approach that enables a fast, reliable and robust evaluation of the side-channel vulnerability of the given products. To this end, standardization bodies such as NIST intend to establish a leakage assessment methodology fulfilling these demands. One of such proposals is the Welch’s t test, which is being put forward by Cryptography Research Inc. and is able to relax the dependency between the evaluations and the device’s underlying architecture. In this work, we deeply study the theoretical background of the test’s different flavors and present a roadmap which can be followed by the evaluation labs to efficiently and correctly conduct the tests. More precisely, we express a stable, robust and efficient way to perform the tests at higher orders. Further, we extend the test to multivariate settings and provide details on how to efficiently and rapidly carry out such a multivariate higher-order test. Including a suggested methodology to collect the traces for these tests, we point out practical case studies where different types of t tests can exhibit the leakage of supposedly secure designs.

Affine equivalence of monomial rotation symmetric Boolean functions: A Pólya’s theorem approach

AbstractTwo Boolean functions are affine equivalent if one can be obtained from the other by applying an affine transformation to the input variables. For a long time, there have been efforts to investigate the affine equivalence of Boolean functions. Due to the complexity of the general problem, only affine equivalence under certain groups of permutations is usually considered. Boolean functions which are invariant under the action of cyclic rotation of the input variables are known as rotation symmetric (RS) Boolean functions. Due to their speed of computation and the prospect of being good cryptographic Boolean functions, this class of Boolean functions has received a lot of attention from cryptographic researchers. In this paper, we study affine equivalence for the simplest rotation symmetric Boolean functions, called MRS functions, which are generated by the cyclic permutations of a single monomial. Using Pólya’s enumeration theorem, we compute the number of equivalence classes, under certain large groups of permutations, for these MRS functions in any number

Generalized classification of modern quantum cryptography and communication methods

Modern powerful computing technology development threatens the confidentiality of information that usually provided by traditional cryptographic means and forces researchers to look for alternative security methods. Given the current trends, these alternatives may be quantum cryptography and communication methods. These methods unlike traditional (classical) analogues use specific unique properties of quantum particles and are based on the inviolability of the quantum physics laws. Existing classifications in quantum cryptography and communications do not include the large number of modern methods. It complicates its study and use in the quantum information security systems development. In the paper modern methods of quantum cryptography and communication were analyzed, their advantages and disadvantages, security assessment to various kinds of cyberattacks were defined, and also the existing classifications of these methods were studied. On the basis of partial generalizations of theoretical positions and practical advances in quantum cryptography, the generalized classification of quantum cryptography and communication methods was constructed. This classification reveals a problem in this area and can extend the possibilities for choosing the appropriate methods for modern quantum information security systems development.

Particle Magic: Need for Quantum Cryptography Research in the South Asian Region

Particle Magic: Need for Quantum Cryptography Research in the South Asian Region

FFT‐based multidimensional linear attack on PRESENT using the 2‐bit‐fixed characteristic

AbstractLinear cryptanalysis is one of the most important cryptanalysis methods and remains vital in the cryptography research up to now. Many derivatives, improvements, and generations of linear cryptanalysis have been introduced to attack the ciphers of different designs. This paper defines a new characteristic of the cryptographic function, called 2‐bit‐fixed characteristic, as a generation of the linear characteristic. Compared with the linear characteristic, it restricts the input more severely to obtain a larger output bias. Using the characteristic, this paper gives a multidimensional linear attack on 27‐round PRESENT with a computation complexity of 274 encryptions, where the fast Fourier transform is employed to deduct the computation complexity. The attack is the first attack on the 27‐round PRESENT of 80 bits master key, verified by experiments for reduced‐round versions, in which we successfully attack 14‐round and 15‐round PRESENT with data complexities of 228 and 231, respectively. Copyright © 2015 John Wiley &amp; Sons, Ltd.

Design and analysis of a three party password-based authenticated key exchange protocol using extended chaotic maps

Recently, the theory and application of Chebyshev polynomials have been studied extremely by the cryptographic research community; many symmetric and asymmetric cryptographic protocols have been designed based on extended chaotic maps. In this paper, a computation cost efficient and robust three party password-based authenticated key exchange (ECM-3PAKE) protocol with key confirmation has been designed using extended chaotic maps and smartcard. In this protocol, two users can establish a common session key with the help of a trusted server. The proposed protocol is shown to be provably secure in the random oracle model and formally validated through the simulation of Automated Validation of Internet Security Protocols and Applications (AVISPA) software. The simulation results from different model checkers of AVISPA proved that the protocol can withstand the active and passive attacks. Besides, the informal security analysis gives the evidence of security and functional efficiencies of the protocol. In addition, the comparative analysis illustrates that the protocol performs better than the existing protocols.

Kristin Lauter on Cryptography and Mathematics

There are unique challenges posed by cryptography research. This interview examines potential threats to modern security techniques and how to overcome them.