Journal of Cryptologic Research
 
Citation Search Quick Search DOI Advanced
  Author Center
   » Submission Online
   » Instruction for Authors
   » Template
   » Copyright Agreement
  Peer Review
   » Peer Review
   » Our peer-review policy
Journal Online
   » Accepted
   » In Press
   » Current Issue
   » Earlier Issues
   » View by Fields
   » Top Downloaded
   » RSS
 

2017, 4(5)
HighLights More»   
· Zero-correlation Linear Cryptanalysis on PICO and RECTANGLE——MA C Y, LIU G Q, LI C
· A New Proof of Determination for the Generalized Polynomial Single Cycle Function——QU C Q, ZHOU X G
· Distinguisher Attack on Reduced-round Keccak——LIU X G, ZHOU J, YU H B
· Efficient Anti-replay Identity-based Signature Scheme for Wireless Body Area Network——HUANG Yi-Cai, ZHANG Xing-Hao, YU Bin
· The Effectiveness of a New Current Flattening Circuit as Countermeasure against Power Analysis——GU Y, WANG C X, ZHOU T, GUAN X G, LUO M
Current Issue Accepted Earlier Issues Top Read Top Downloaded Top Cited
  Journal of Cryptologic Research--2017, 4 (5)   Published: 30 October 2017
Select | Export to EndNote
Zero-correlation Linear Cryptanalysis on PICO and RECTANGLE Hot!
MA C Y, LIU G Q, LI C
Journal of Cryptologic Research. 2017, 4 (5): 413-422. ;  doi: 10.13868/j.cnki.jcr.000193
Full Text: HTML (1 KB)  PDF (1177 KB)  ( 0 )
Show Abstract ( 90 )

Mixed-Integer Linear Programming (MILP) is a method frequently used to solve optimization problems. In 2012, Mouha et al. applied MILP to evaluate the security of cipher algorithms, and succeeded in counting the minimum number of active S-boxes. PICO and RECTANGLE are lightweight block ciphers with a SPN structure. The study of the zero-correlation linear cryptanalysis on these two ciphers needs to be improved. This paper focused on the zero-correlation linear approximation of PICO. A new model is built to search the trails for PICO cipher, and many 7-round zero-correlation linear approximations are found. Those linear approximations are better than those 4-round zero-correlation linear approximations given by the designer. Furthermore, A 7-round multidimensional zero-correlation linear distinguisher is constructed, and a key-recovery attack against 10-round PICO is proposed. It is shown that our attack can recover 50 bits of the round keys. This key-recovery attack needs 242.3 bytes of memory and about 263.3 known plaintexts. The time complexity is about 268.7 of 10-round PICO encryptions. With a similar method, 208 8-round zero-correlation linear approximations of RENTANGLE are found, and a 11-round zero-correlation linear attack on RECTANGLE is proposed. This key-recovery attack can recover 44 bits of the round keys, which needs about 263 known plaintext and about 2107 of 11-round RECTANGLE encryptions.

A New Proof of Determination for the Generalized Polynomial Single Cycle Function Hot!
QU C Q, ZHOU X G
Journal of Cryptologic Research. 2017, 4 (5): 423-430. ;  doi: 10.13868/j.cnki.jcr.000194
Full Text: HTML (1 KB)  PDF (356 KB)  ( 51 )
Show Abstract ( 36 )

T-functions, proposed by Klomiv and Shamir in 2002, is a new class of nonlinear functions, which could be efficiently implemented in both software and hardware and produce sequences with high linear complexity and good stability. T-functions can substitute LFSR as a new driver in stream ciphers. Polynomial functions, as a special class of T-functions, have numerous applications in cryptography. Their invertibility and periodicity are two important research topics. Using the ANF of the function, Klimov et al gave a sufficient condition for polynomial function   to be a single-cycle, while combing the bit-slice methods and the parameter they gave a sufficient condition for generalized polynomial function  to be a permutation. Further more, Liu Zhuo-Jun et al gave the necessary and sufficient condition for the function  to be a single-cycle by means of the multiplication formula of 2-adic integers given by Xu Ke-Jian. In this paper, by using the modulo 2 derivatives of 1-Lipschitz function, improving the technique of determining the ergodic transformation with use of the modulo 4 derivatives, and using the bit-slice methods, a new method to determine the ergodic transformation is proposed, and a new proof of determination of the generalized polynomial single cycle function is given.

Distinguisher Attack on Reduced-round Keccak Hot!
LIU X G, ZHOU J, YU H B
Journal of Cryptologic Research. 2017, 4 (5): 431-446. ;  doi: 10.13868/j.cnki.jcr.000195
Full Text: HTML (1 KB)  PDF (1911 KB)  ( 60 )
Show Abstract ( 54 )

The Keccak hash function is the winner of NIST's SHA-3 competition. The best cryptanalysis result for the differential distinguisher attack on the hash function settings of Keccak is a 6 round distinguisher proposed by Sourav Das and Willi Meier, which is based on TDA algorithm, Double Kernel structure and differential propagation characteristics. This paper improves the result and obtains a 6-round distinguisher with the best known complexity of the same kind of distinguishers. Moreover, an S-Box control method is proposed, which finds out the influence of each active S-Box on the output difference. Combing the S-Box control method and the 6-round distinguisher mentioned above, a distinguisher on 7 rounds of Keccak hash function is found with complexity being 268.

Efficient Anti-replay Identity-based Signature Scheme for Wireless Body Area Network Hot!
HUANG Yi-Cai, ZHANG Xing-Hao, YU Bin
Journal of Cryptologic Research. 2017, 4 (5): 447-457. ;  doi: 10.13868/j.cnki.jcr.000196
Full Text: HTML (1 KB)  PDF (899 KB)  ( 24 )
Show Abstract ( 40 )

    Authentication of the broadcast message in wireless body area network (WBAN) is the key to prevent sensor nodes from receiving malicious instructions. Digital signature is one of the effective methods to solve the message authentication. Due to the restriction of network hierarchy, computing and storage resources, it is unable for WBAN to support public key cryptosystem based on digital certificates. Identity-based signature is more suitable for wireless sensor network (WSN) which is difficult to maintain manually. However, when comes to practical use, there still exists some doubt about security for the IBS based on random oracle model. And the standard model-based IBS schemes always cost large amount of calculation. Therefore, a kind of efficient IBS based on Paterson solution for WBAN is proposed, and its security can be reduced to the hardness of computational Diffie-Hellman (CDH) problem under standard model. Based on some analysis about Paterson solution, Li-Jiang solution and Gu solution, a new way of parameter construction under the WBAN communication model is presented. Combined with the on-line/off-line signature coupon, the scheme has less on-line calculation cost and small scale of public parameters, and will not halt among the queries in proof of security. Finally, based on theoretical analysis and experiment, the scheme is proposed to be strongly unforgeable and efficient. Compared with previous schemes which are proved to be secure under standard model, this scheme is more efficient, and more suitable for resource-limited applications like WBAN.

The Effectiveness of a New Current Flattening Circuit as Countermeasure against Power Analysis Hot!
GU Y, WANG C X, ZHOU T, GUAN X G, LUO M
Journal of Cryptologic Research. 2017, 4 (5): 458-471. ;  doi: 10.13868/j.cnki.jcr.000197
Full Text: HTML (1 KB)  PDF (4689 KB)  ( 36 )
Show Abstract ( 33 )

Different power analysis is an effective way to the side channel analysis of the cryptographic chips, an attacker can analyze the key in the chip by monitoring the power consumption curve during the execution of their internal programs, which may pose a serious threat to the security of the cryptographic device. In order to improve the capability of anti-power analysis of cryptographic chips, a novel current flattening circuit based on power balance principle is proposed. The circuit is independent of the cryptographic algorithm and does not affect the original design flow of the cryptographic chip. The current flattening circuit increases the configurable circuit that controls current, the configurable current flattening circuit realizes the hierarchical and flexible control of the flattening current, reduces the relative power consumption of the system, adapts flexibly to the cryptographic chip with different current peak, and enhances the robustness of the system. The current flattening circuit contains six parts: configuration current detection module, configurable reference voltage module, current compensation module, reference current module, folded cascade amplifier and passive low-pass filter. In this paper, the circuit is designed under SMIC the 65nm logic low leakage CMOS process, the core circuit layout area is 0.071mm2, the power consumption is less than 5mA. The test results show that the circuit can work effectively over a wide frequency range, and the current change of the cryptographic chip can be hidden in time by the corresponding time of 2.17ns. The flattened current value can be adjusted from 0 to 32mA, and the decay rate of current fluctuation on the power supply can reach 96.2%.

Preface on Post-quantom Cryptography Hot!
YU Y
Journal of Cryptologic Research. 2017, 4 (5): 472-473. ;  doi: 10.13868/j.cnki.jcr.000198
Full Text: HTML (1 KB)  PDF (140 KB)  ( 110 )
Show Abstract ( 69 )
A Survey on the Construction of Hash Proof Systems based on Lattices Hot!
LAI Q Q, YANG B, YU Y, CHEN Y, GU X Y
Journal of Cryptologic Research. 2017, 4 (5): 474-484. ;  doi: 10.13868/j.cnki.jcr.000199
Full Text: HTML (1 KB)  PDF (1015 KB)  ( 118 )
Show Abstract ( 75 )

Since the concept of hash proof system was first introduced by Cramer and Shoup in 2002, its great and potential cryptographic value has been understood gradually. As a special non-interactive zero knowledge proof system for certain NP language, hash proof system has played an irreplaceable role in the development of cryptographic theory. Till now, the research on hash proof systems has been one of the hottest research topics in cryptography. Particularly, with the emerging of post-quantum cryptography, it becomes more important to investigate new hash proof systems resisting against quantum attacks. This paper first reviews the concept and cryptographic applications of hash proof systems, and then summarizes its generic construction method from classical hardness assumptions. Furthermore, Formal definitions of hash proof system, \textrm{id}entity-based hash proof systems and attribute-based hash proof systems are presented, and their key points are clarified. Efforts have been made to summarize the recent research status on lattice-based hash proof systems, analyze the characters of existing representative constructions, and point out several obstacles for the related researches.

Post-quantum Key Exchange from Lattice Hot!
LIU Y M, LI X X, LIU H L
Journal of Cryptologic Research. 2017, 4 (5): 485-497. ;  doi: 10.13868/j.cnki.jcr.000200
Full Text: HTML (1 KB)  PDF (548 KB)  ( 140 )
Show Abstract ( 65 )

Cryptosystems based on classical number-theoretical assumptions, such as integer factoring and discrete logarithm, can be broken by quantum algorithms efficiently in theory, while the rapid development of quantum computers is becoming threats of classical cryptosystems in practice. Thus, the design of post-quantum cryptosystems is an important (or even urgent) research direction of cryptography, wherein the most urgent is the need for post-quantum key exchange protocols, which is a hot topic in recent years. In this paper we mainly focus on the post-quantum protocols from computational hard problems on lattices, such as LWE, ring-LWE, and module-LWE, especially the most-basic unauthenticated key exchange protocols, such as BCNS15, NewHope/NewHope-simple, Frodo, and Kyber.KE. We will introduce the key techniques, the choice of parameters, communication costs, computation efficiency and security of these protocols.

Heuristic Algorithm for the Subset Sum Problem based on Simultaneous Diophantine Approximation Hot!
WANG B C, LU K
Journal of Cryptologic Research. 2017, 4 (5): 498-505. ;  doi: 10.13868/j.cnki.jcr.000201
Full Text: HTML (1 KB)  PDF (490 KB)  ( 67 )
Show Abstract ( 24 )

    The subset sum problem is one of the most significant problems in computer science, and the problem has been used in designing public key cryptographic schemes and pseudorandom functions due to the NP-completeness nature. Therefore, the study of the subset sum problem is of important significance in both computer science and cryptography. Under the basic P!=NP hypothesis, there must exist no polynomial-time algorithms to solve the subset sum problem. Some general-purpose algorithms for solving generic subset sum problems and special-purpose algorithms for solving special subset sum problems have been proposed in the literature. This paper proposes a novel heuristic algorithm for solving the subset sum problem by establishing a connection between the subset sum problem and the simultaneous Diophantine approximation problem. The basic idea of the proposed algorithm is to firstly construct simultaneous Diophantine problems from the given subset sum problem, then find the solutions to the simultaneous Diophantine problems via lattice reduction algorithms, construct new subset sum problems independent of the original subset sum problem and from the solutions to the simultaneous Diophantine problems, ultimately reduce the dimension of the original subset sum problem. Finally, the binary solution to the original subset sum problem is determined by solving an n-variable system of n linear equations, which is derived from n-1 linearly independent subset sum problems constructed by solving simultaneous Diophantine approximation problems. The significance of the new approach in this paper provides new insights into the subset sum problem.

Cryptography with Auxiliary Input from Constant-noise LPN Hot!
CHENG H T, HAN G, QIAN H F
Journal of Cryptologic Research. 2017, 4 (5): 506-516. ;  doi: 10.13868/j.cnki.jcr.000202
Full Text: HTML (1 KB)  PDF (616 KB)  ( 62 )
Show Abstract ( 37 )

Dodis, Kalai and Lovett (STOC 2009) initiated the study of the Learning Parity with Noise (LPN) problem with (static) exponentially hard-to-invert auxiliary input. In particular, they showed that under a new assumption (called Learning Subspace with Noise) the above is quasi-polynomially hard in the high (polynomially close to uniform) noise regime. Based on the ``sampling from subspace'' technique by Yu (eprint 2009/467) and Goldwasser et al. (ITCS 2010), standard LPN can work in a mode (reducible to itself) where the constant-noise LPN (by sampling its matrix from a random subspace) is robust against sub-exponentially hard-to-invert auxiliary input with comparable security to the underlying LPN. Under constant-noise LPN with certain sub-exponential hardness (i.e., ) for secret size n), a variant of the LPN with security on poly-logarithmic entropy sources is obtained, which in turn implies CPA/CCA secure public-key encryption (PKE) schemes and oblivious transfer (OT) protocols. Prior to this, basing PKE and OT on constant-noise LPN had been an open problem since Alekhnovich's work (FOCS 2003).

Journal of Cryptologic Research
Accepts
Note: The papers published below will continue to be available from this page until they are assigned to an issue. To see an article, click its [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Selected articles' button. To see one abstract at a time, click its [Abstract] link.
Journal of Cryptologic Research
2017 Vol.4      No.1      No.2      No.3      No.4
2016 Vol.3      No.1      No.2      No.3      No.4      No.5      No.6
2015 Vol.2      No.1      No.2      No.3      No.4      No.5      No.6
2014 Vol.1      No.1      No.2      No.3      No.4      No.5      No.6
密码学报
 Top Read
»

Bitcoin and Digital Fiat Currency

QIN B, CHEN L C H, WU Q H, ZHANG Y F, ZHONG L, ZHENG H B
2017, 4(2): 186-186. Full Text: PDF (1282KB) (1677)
»

The Design of an Anti-Counterfeiting System Based on Blockchain

AN R, HE D B, ZHANG Y R, LI L
2017, 4(2): 208-208. Full Text: PDF (2475KB) (1456)
»

Design and Analysis of Stream Ciphers: Past, Present and Future Directions

ZHANG B, XU C, FENG D G
2016, 3(6): 545-545. Full Text: PDF (1123KB) (1160)
»

A Survey on the Intersection of Cryptography and Game Theory

PENG C G, TIAN Y L, LIU H, DING H F
2017, 4(1): 15-15. Full Text: PDF (706KB) (945)
»

Preface on Cryptocurrency

ZHANG F G
2017, 4(2): 0-0. Full Text: PDF (186KB) (549)
»

Debug and Analysis on Fully Homomorphic Cryptography

LU S Q, WANG S F, HAN X, CHENG Q F
2017, 4(1): 28-28. Full Text: PDF (2322KB) (781)
»

One-time Signature Scheme Based on Dynamic Chameleon Authentication Tree

WANG H W, XU J, NI P, ZHOU F C
2016, 3(6): 618-618. Full Text: PDF (496KB) (476)
»

A Privacy Preserving Fair Contract Signing Protocol based on Block Chains

TIAN H B, HE J J, FU L Q
2017, 4(2): 198-198. Full Text: PDF (883KB) (1165)
»

Biclique Cryptanalysis on Light-weight Block Cipher mCrypton-64

YUAN Z, LI D
2016, 3(6): 572-572. Full Text: PDF (711KB) (532)
»

Analysis of a New CCA-secure Public-key Cryptosystem

WANG X, XUE R
2017, 4(2): 113-113. Full Text: PDF (728KB) (557)
»

Security Evaluation for Fault Attacks on Lightweight Block Cipher Midori

WANG Y D, ZHAO X J, ZHANG F, GUO S Z, WU L F, LI W, LOU X X
2017, 4(1): 78-78. Full Text: PDF (602KB) (443)
»

Differential Fault Attack on CRT-RSA

LI Z J
2016, 3(6): 554-554. Full Text: PDF (431KB) (583)
»

Related-key Differential Attack on Lightweight Block Cipher ESF

YIN Jun, SONG Jian, ZENG Guang, MA Chuan-Gui
2017, 4(4): 344-344. Full Text: PDF (2109KB) (464)
»

A Transformed BF-IBE Scheme with Adaptive Security in the Standard Model

WANG X Q, XUE R
2017, 4(1): 48-48. Full Text: PDF (521KB) (525)
»

Multi-identity-based Fully Homomorphic Encryption from Obfuscation

WANG W L, HU B
2017, 4(2): 175-175. Full Text: PDF (760KB) (459)
»

True Random Number Generator for Smart Cards and Post-Processing Algorithm Research

JIA X Y, WU L J, ZHANG X M, WU X J
2016, 3(6): 563-563. Full Text: PDF (1505KB) (550)
»

A Multidimensional Data Aggregation Scheme in Multilevel Network in Smart Grid

ZHOU H, CHEN J, ZHANG Y Y, DANG L J
2017, 4(2): 132-132. Full Text: PDF (2728KB) (350)
»

A Note on Vectorial Bent Functions in Binomial Forms

HUANG D M, TANG C M.
2017, 4(2): 105-105. Full Text: PDF (649KB) (323)
»

Preface on Cryptographic Functions

ZHANG Wei-Guo
2017, 4(3): 0-0. Full Text: PDF (108KB) (289)
»

Rational Secret Sharing Scheme Based on Group

LI M H, TIAN Y L
2017, 4(3): 217-217. Full Text: PDF (420KB) (288)
»

Security Analysis for Arbitrated Quantum Signature Scheme based on Random Oracle Model

LEI Q, SHANG T, LIU J W
2016, 3(6): 628-628. Full Text: PDF (480KB) (418)
»

A New Broadcast Attack against NTRU

YANG Z C, FU S J, QU L J, LI C, XIE D Q
2016, 3(6): 606-606. Full Text: PDF (951KB) (379)
»

Improved Differential Attack on 16-round PRESENT Cipher

TIAN Ya, CHEN S Z, DAI Y B
2016, 3(6): 583-583. Full Text: PDF (458KB) (365)
»

Multiple Differential Attack on 21-round SMS4

SONG H Y X, GAO H Y
2016, 3(6): 595-595. Full Text: PDF (424KB) (413)
»

A Hyperchaotic Digital Voice Encryption Algorithm for Mobile Communication

LIU W H, SUN K H, ZHU C X
2017, 4(1): 98-98. Full Text: PDF (2812KB) (456)
»

Reconstructing Truncated Sequences Derived from Primitive Sequences over Integer Residue Rings

YANG J B, ZHU X Y
2017, 4(2): 150-150. Full Text: PDF (510KB) (305)
»

A Boolean Circuit Homomorphic Encryption Scheme Based on LWE Problem

JI C, CAI B, XIANG H, DING J T,SANG J
2017, 4(3): 240-240. Full Text: PDF (824KB) (223)
»

Power Analysis and Protection on BBC encoding LBlock Decryption Algorithm

GUAN M Y, YU G R, XIANG Y X, TAN Z N, ZHANG G S, WANG A
2017, 4(3): 228-228. Full Text: PDF (3499KB) (126)
»

Verifiable Outsourcing Attribute-based Signature Scheme

HAN Y L, CHEN F, CHEN X Y
2017, 4(2): 164-164. Full Text: PDF (1224KB) (331)
Journal of Cryptologic Research
 Top Download
»

Research on Attribute-based Cryptography

Feng D G, Chen C
2014, 1(1): 12-12. Full Text: PDF (769KB) (5713)
»

Survey of Lattice-based Cryptography

Wang X Y, Liu M J
2014, 1(1): 27-27. Full Text: PDF (678KB) (5296)
»

An Overview on the Security Techniques and Challenges of the Internet of Things

Wu C K
2015, 2(1): 53-53. Full Text: PDF (401KB) (4150)
»

Research on White-box Cryptography

Lin T T, Lai X J
2015, 2(3): 267-267. Full Text: PDF (333KB) (3632)
»

Secret Key Extraction in Wireless Channel

Li G Y, Hu A Q, Shi L
2014, 1(3): 224-224. Full Text: PDF (1519KB) (3196)
»

Provable Security for Public Key Encryption——Challenges and Approaches

Liu S L
2014, 1(6): 550-550. Full Text: PDF (447KB) (2830)
»

Cryptanalysis of Quantum Cryptographic Protocols

Wen Q Y, Qin S J, Gao F
2014, 1(2): 210-210. Full Text: PDF (866KB) (2794)
»

A Threshold Scheme for SM2 Elliptic Curve Cryptographic Algorithm

Shang M, Ma Y, Lin J Q, Jing J W
2014, 1(2): 166-166. Full Text: PDF (1051KB) (2461)
»

Power Analysis on Lightweight Mask Scheme

Tang M, Wang X, Li Y B, Xiang X, Qiu Z L, Zhang H G
2014, 1(1): 63-63. Full Text: PDF (1621KB) (2439)
»

Faster Cryptanalytic Time-memory Trade-off Using Rainbow Table

Zheng Z X, Ji Q B, Yu H B
2014, 1(1): 110-110. Full Text: PDF (778KB) (2423)
Top Cited

Top CitedTop CitedTop CitedTop CitedTop Cited
  Email Alert
Supervised&Sponsored
Supervised by China Association for Science and Technology(CAST)
Sponsored by Chinese Association for Cryptologic Research(CACR),Beijing Academy of Information Science & Technology(BAIST) and China Science and Technology Press
Announcement
more>>     
Links
   » CACR
   » mathmagic
   » Journal of Software
Copyright © Journal of Cryptologic Research