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

2022, 9(2)
HighLights More»   
· A Survey of Pairings on Elliptic Curve-based Cryptography——WANG B, HU H G
· Efficient RFID Security Authentication Protocol Based on Variable Modulus and Self-updating Key Matrix——WANG Y, LEI X M, GAO T
· Differential Fault Attack on Lightweight Block Cipher SLIM——GAO Y, WANG Y J, GAO G P, YUAN Q J, WANG C
· Formal Analysis and Improvement Methods of 5G AKA Protocol Based on Tamarin——LIU D, WANG Z Y, LI D W, GUAN Z Y, SUN Y, LIU J W
· Multi-key Fully Homomorphic Encryption System that Supports Multi-bit Encryption——LI X X, TANG C M, HU Y Z
Current Issue Accepted Earlier Issues Top Read Top Downloaded Top Cited
  Journal of Cryptologic Research--2022, 9 (2)   Published: 05 May 2022
Select | Export to EndNote
Reviews
A Survey of Pairings on Elliptic Curve-based Cryptography Hot!
WANG B, HU H G
Journal of Cryptologic Research. 2022, 9 (2): 189-209. ;  doi: 10.13868/j.cnki.jcr.000512
Full Text: HTML (1 KB)  PDF (445 KB)  ( 95 )
Show Abstract ( 131 )

In recent years, pairings on elliptic curves have many applications in cryptographic protocols. Hence, the efficiency of the pairing computation is required to be as faster as possible. In order to improve the efficiency of the pairing computation, on one hand, researchers improved the existing pairings in both theory and algorithms; on the other hand, constructions of new faster pairings have been of great interest. This paper presents a detailed survey on the history of pairings in the last two decades. The fast algorithms regarding pairing, such as the construction of pairing-friendly elliptic curves, the improvement of Miller's algorithm, etc., and the computationally hard problems regarding pairing, such as the bilinear Diffie-Hellman problem, the bilinear inversion problem, etc., have been active research issues in cryptography. This paper briefly reviews them based on the latest research results.

Articles
Efficient RFID Security Authentication Protocol Based on Variable Modulus and Self-updating Key Matrix Hot!
WANG Y, LEI X M, GAO T
Journal of Cryptologic Research. 2022, 9 (2): 210-222. ;  doi: 10.13868/j.cnki.jcr.000513
Full Text: HTML (1 KB)  PDF (2564 KB)  ( 25 )
Show Abstract ( 57 )

In order to construct an efficient and secure authentication protocol for low-cost RFID tags, a new variable modulus key matrix encryption algorithm is proposed in this paper. This algorithm can realize the online update of the module parameters of the key matrix in the process of RFID tag authentication. At the same time, the encryption or decryption matrix can be self-updated through the matrix elementary transformation method, so that the algorithm can further weaken the correlation between plaintext and ciphertext. The security is improved compared with traditional key matrix encryption algorithms. Meanwhile, the Winograd algorithm is used in the encryption and decryption process of the key matrix to reduce the amount of computation in the tag authentication process. By adding a small number of addition operations, the number of multiplication operations can be greatly reduced, thereby improving the real-time performance of tag authentication. Through calculation and analysis, it is concluded that when the plaintext length n is greater than 8, the number of multiplication operations in the encryption process is reduced by nearly 50% after using Winograd algorithm. In addition, this authentication protocol can select different values of modulus p for different applications to improve the security, irrespective of the storage limitation of low-cost RFID tags. Finally, by BAN logic analysis and protocol security analysis, it shows that the RFID security authentication protocol based on the variable modulus key matrix proposed in this paper can effectively prevent many typical attacks on RFID systems.

Differential Fault Attack on Lightweight Block Cipher SLIM Hot!
GAO Y, WANG Y J, GAO G P, YUAN Q J, WANG C
Journal of Cryptologic Research. 2022, 9 (2): 223-236. ;  doi: 10.13868/j.cnki.jcr.000514
Full Text: HTML (1 KB)  PDF (1963 KB)  ( 40 )
Show Abstract ( 51 )

SLIM is a new lightweight block cipher proposed in 2020. Due to its extremely low gate-circuit power consumption and excellent hardware implementation performance, it has certain potential applications for resource-constrained devices for tiny-scale encryption systems. Differential fault attack is an effective method to threat lightweight ciphers. In this paper, the nibble fault attack model is introduced to analyze the SLIM cipher. Combined with the key expansion scheme and the differential diffusion properties in SLIM algorithm, a fault injection strategy is proposed. The faults with the width of 1 to 4 nibbles are injected in the second to 32nd rounds separately. The group of number of fault injection is at least 62, which can reduce the computational complexity of recovering the main key to 2^3. This paper studies the differential non-uniformity of the S-box in SLIM cipher. The S-box differential distribution table is established by analyzing the correspondence between the input difference, the output difference and possible input values. Then solving a differential equation is directly converted into a lookup table, which can reduce the solution space of the differential equation efficiently. The properties of S-box differential distribution is further used to analyze whether the equation has a unique solution. Based on the knowledge of probability, the success rate of key recovery per round under different number of fault injection groups is calculated, and the expectation of fault injection groups of recovering the main key is 68.15. Simulation experiments show that, the average number of fault injection groups for 1000 attacks is 69.07, which is similar to the theoretical result.

Formal Analysis and Improvement Methods of 5G AKA Protocol Based on Tamarin Hot!
LIU D, WANG Z Y, LI D W, GUAN Z Y, SUN Y, LIU J W
Journal of Cryptologic Research. 2022, 9 (2): 237-247. ;  doi: 10.13868/j.cnki.jcr.000515
Full Text: HTML (1 KB)  PDF (3402 KB)  ( 41 )
Show Abstract ( 42 )

For 5G mobile communication networks, the 3GPP group has standardized protocols such as 5G AKA for identity authentication and key agreement. This paper applies Tamarin, a security protocol verification tool, to carry out a formal analysis of the 5G AKA protocol. Firstly, the formal modeling of the 5G AKA protocol and its expected security properties are accomplished based on 3GPP TS 33.501 v17.0.0 version. Security properties take secrecy properties and Lowe authentication properties into consideration. The secrecy properties include the secrecy of the security anchor key $K_{\text{SEAF}}$ and the long-term shared key $K$. The authentication properties include the non-injective agreement on the parameters SUPI, SNID, and $K_{\text{SEAF}}$, and the injective agreement on the $K_{\text{SEAF}}$ between the parties of the protocol. This paper then verifies and confirms that the 5G AKA protocol satisfies the relevant security properties in the Tamarin, while the authentication properties are verified for a total of 36 cases, in which 23 cases are not satisfied. Finally, for the authentication properties that the protocol does not satisfy, this paper uses three modification methods to improve the protocol model, and analyzes and summarizes the verification results before and after the improvement.

Multi-key Fully Homomorphic Encryption System that Supports Multi-bit Encryption Hot!
LI X X, TANG C M, HU Y Z
Journal of Cryptologic Research. 2022, 9 (2): 248-256. ;  doi: 10.13868/j.cnki.jcr.000516
Full Text: HTML (1 KB)  PDF (473 KB)  ( 46 )
Show Abstract ( 64 )

This study first constructs a fully homomorphic encryption scheme which supports multi-bit encryption (hereinafter referred to as MBGSW). The scheme is based on the full homomorphic encryption based on DLWE which supports multi-bit encryption proposed by Li Zengpeng et al., and the encryption algorithm is modified to make it become multi-bit fully homomorphic encryption without using the CRS model. Then, the single secret key ciphertext is extended to multi-key ciphertext by using the LinkAlgo algorithm, so as to realize the multi-key fully homomorphic encryption (MFHE). The multi-key fully homomorphic encryption (MFHE) allows the homomorphic operation between ciphertext encrypted under different keys, and finally realizes multi-bit multi-key fully homomorphic encryption.

A New Implementation Method of S-box for Against DFA Hot!
XU Y H, LI Z H, FAN Y H, WANG M Q
Journal of Cryptologic Research. 2022, 9 (2): 257-266. ;  doi: 10.13868/j.cnki.jcr.000517
Full Text: HTML (1 KB)  PDF (1616 KB)  ( 20 )
Show Abstract ( 43 )

As an active physical attack, differential fault analysis (DFA) poses a certain threat to the security of cryptographic products. In order to effectively resist DFA attack, Aghaie et al. proposed an error detection circuit. In the hardware implementation of cryptographic algorithm, the detection circuit requires the circuit of S-box to meet the independence property to avoid error diffusion. Aghaie et al. realized the independence property of an S-box by a lookup table (LUT). This paper proposes a new algorithm to search independent Boolean function representation of a known S-box. The proposed algorithm makes the hardware implementation of an S-box satisfy the independence property without a shared gate before the hardware synthesis. In the traditional LUT method, the synthesizer uses the internal optimization algorithm to obtain the independent circuit implementation of S-boxes. However, for S-boxes that require independent implementation, this general optimization algorithm of the synthesizer is often inefficient. This paper applies the algorithm of searching the independence of a given S-box to some specific S-boxes, such as those in GIFT, Khazad, LBlock, etc. The experimental results show that for different S-boxes, the implementation efficiency is improved.

Image Robust Encryption Algorithm Based on Scrambled Block Compressive Sensing Hot!
WANG L, XIAO D, WANG F, SHI X
Journal of Cryptologic Research. 2022, 9 (2): 267-283. ;  doi: 10.13868/j.cnki.jcr.000518
Full Text: HTML (1 KB)  PDF (12069 KB)  ( 17 )
Show Abstract ( 38 )

How to transmit image data efficiently and ensure the security and robustness of images in a resource-constrained environment is challenging. In this paper, a robust image encryption algorithm based on scrambled block compressive sensing (SBCS) is proposed for simultaneously compressing, sampling, encryption and robust transmission. The original images are sparsely represented with DWT and sampled with SBCS, which can reduce the data volume, realize the initial encryption and enhance the security of the data. A simple quantizer is designed to quantify the measurements to a limited accuracy. The quantified values are encrypted to further guarantee security through combining permutation and diffusion with the keys generated by the Logistic-Tent chaotic map. For the receiver, the cipher images can be jointly decrypted through inverse confusion-diffusion and high-performance reconstruction by using the GRSR algorithm. The experimental simulation and comparative analysis results are as follows. The PSNR of the reconstructed image reaches 20.4 dB when the sampling rate is 0.05. The PSNR of the reconstructed image is 22.24 dB when the packet loss rate reaches 90%. In the interference of the crop size of 256×256, the reconstructed images still retain the main information and visually acceptable. In summary, the proposed algorithm can resist common attacks such as brute force attack, statistical attack, packet loss attack, cropping attack, and noise attack, and has the robustness against those attacks while ensuring the transmission efficiency.

Asynchronous Accumulator Hardware Trojan Activated by Laser Hot!
YUAN R J, ZHU X, HAN J W, LI Y, MA Y Q, SHANGGUAN S P, WANG T
Journal of Cryptologic Research. 2022, 9 (2): 284-293. ;  doi: 10.13868/j.cnki.jcr.000519
Full Text: HTML (1 KB)  PDF (10040 KB)  ( 12 )
Show Abstract ( 34 )

With the development of integrated circuit design, there is a hidden threat of chips implanted by hardware Trojan. In the previous research of hardware Trojan detection, the detection rate of the logic test detection method is low, and the side channel detection method are affected by the low trigger rate of the hardware Trojan seriously. This paper proposes a novel approach to activate the hardware Trojan based on the laser injection. The physical location of the hardware Trojan can be located. The FPGA-based asynchronous accumulator hardware Trojan was activated by 1064 nm picosecond pulse laser successfully. The results show that the laser injection method has nothing to do with the trigger condition of the hardware Trojan with the logical trigger structure. By designing a high coverage rate injection method, the hardware Trojan can be activated with high probability.

A Secure Multiparty Intersection Computation Hot!
ZHAO X L, JIA Z L, LI S D
Journal of Cryptologic Research. 2022, 9 (2): 294-307. ;  doi: 10.13868/j.cnki.jcr.000520
Full Text: HTML (1 KB)  PDF (836 KB)  ( 33 )
Show Abstract ( 42 )

Secure multi-party computation is not only a core privacy preserving technology, it is also a hot issue in the international cryptographic community. Set operation is a significant problem of secure multi-party computation because many problems can be transformed to set operation problems. The existing secure set operation solutions include secure intersection (union) computation, secure intersection cardinality computation, secure determination of the relationship between an element and a set, secure set inclusion determination etc. This paper addresses three new problems by using private substitution, encryption selection and additive homomorphism of encryption system. These problems can be used to securely determine the relationship between a threshold and the cardinality of intersection (union) of private sets, securely determine the relationship between an element and the intersection (union) of private sets, and securely determine the relationship between a set and the intersection (union) of private sets. When the data range is known, the data is encoded to an array to perform secure computation without disclosing the intersection (union) of the private sets. Meanwhile, the threshold lifted ElGamal cryptosystem can be used to resist collusion attacks. It is proved that, by using the simulation paradigm, the designed protocols are secure in the semi-honest model.

Side-channel Attacks Based on CBAPD Network Hot!
ZHENG D, LI Y N, ZHANG M L
Journal of Cryptologic Research. 2022, 9 (2): 308-321. ;  doi: 10.13868/j.cnki.jcr.000521
Full Text: HTML (1 KB)  PDF (6779 KB)  ( 17 )
Show Abstract ( 37 )

Side-channel attacks are powerful cryptanalytic attacks, which have attracted extensive attention in the society of cryptography since their proposal. In recent years, deep learning technique has been increasingly applied to side-channel attacks, and how to improve its performance is a hot spot of research. Based on characteristics of the target data, a new convolutional neural network, named CBAPD, is presented. The new network removes the activation function in a basic convolutional layer, adds a batch normalization layer after the convolutional layer, and then adds an activation layer after the batch normalization layer to activate sensitive information. To evaluate performance of the CBAPD, two public datasets, ASCAD and DPA-contest v4, are tested. Experiment results show that the proposed network needs only 50 traces on the ASCAD synchronous dataset for successful attacks, and requires 160 and 1850 traces on the datasets with the maximum asynchronous sizes of 50 and 100 sample points respectively, to make the rank value drop to 0 and then remain unchanged. On the DPA-contest v4 dataset, the CBAPD model needs only 3 traces to lunch an attack successfully. Meanwhile, compared with the $ \rm CNN_{best} $ model proposed by Benadjila et al. in 2019, the SincNet proposed by Chen et al. and the model proposed by Zaid et al. in 2020, the traces required by CBAPD model for successful attacks on the ASCAD dataset with the maximum asynchronous sizes of 50 sample points can be reduced by 34.426%~96.8%. On the DPA-contest v4 dataset, the CBAPD model has the same attack effect as the model proposed by Zaid et al. and outperforms the other two models. Therefore, the proposed CBAPD model has good performance on different datasets.

Analysis of Implementation of Parallel Pollard rho Algorithm for ECC2-131 Hot!
GUAN P D, LUO Y Q, ZHANG F G, TIAN H B
Journal of Cryptologic Research. 2022, 9 (2): 322-340. ;  doi: 10.13868/j.cnki.jcr.000522
Full Text: HTML (1 KB)  PDF (554 KB)  ( 17 )
Show Abstract ( 39 )

Pollard rho algorithm and its distributed variants are currently known as the best algorithms for solving the discrete logarithm problem of elliptic curve groups over finite fields. Since the Pollard rho algorithm was proposed, many cryptographers proposed a variety of improved algorithms for the distributed Pollard rho algorithm. This paper analyzes the efficiency of three distributed Pollard rho algorithms which are based on a different iteration function, and implements the algorithm as a software program for ECC2-131 on a general CPU. This paper finds that, the algorithm based on the r-adding walk achieves the optimal efficiency in theoretical analysis and in program implementation, which means that distributed Pollard rho algorithm based on the r-adding walk plays an important role on for solving ECDLP. This paper tested the efficiency of the Pollard rho algorithm on computer workstation and the Tianhe-2 supercomputer, and found that it is still difficult to solve the ECC2-131 based on the current algorithm for solving the discrete logarithm problem and the available computing power, and the cost of time and money is unrealistic. This paper also presents the irreducible polynomial with the best computational performance for the finite field F_{2^{131}}. By inducing the isomorphism of elliptic curve from the isomorphism of finite field, the ECDLP can be solved on the elliptic curve obtained after isomorphism. If the software implementation of the algorithm uses the new elliptic curve, the efficiency of the modular operation can be improved by 11.29%, and the efficiency of multiplication operation can be improved by 11.23%, which makes a further improvement on the efficiency of solving ECDLP.

Secure Data Deduplication Scheme Based on Intel SGX Hot!
ZHANG X Y, XIAN H Q, LU Q, TIAN C L
Journal of Cryptologic Research. 2022, 9 (2): 341-352. ;  doi: 10.13868/j.cnki.jcr.000523
Full Text: HTML (1 KB)  PDF (2173 KB)  ( 17 )
Show Abstract ( 42 )

In cloud storage services, secure deduplication often relies on a trusted third party (TTP). To solve this problem, hardware security technology is introduced to assist clients in key management, and a secure encrypted data deduplication method based on Intel SGX is proposed. The Enclave provided by Intel SGX is used as a trusted execution environment to help clients with privacy protection. Remote attestation can be used to build an end-to-end secure channel between the cloud server and clients Enclave to transfer sensitive information, and data sealing is employed to help clients achieve secure storage of private data. Security analysis and performance evaluation show that, compared with previous methods, the proposed method has greater security in key and communication, and also has some advantages in system overhead and average runtime. In addition, since there is no trusted third party, it is easy to implement in real-world applications, and has some application value.

Concretely Efficient Deniable Encryption Scheme from Single-key Functional Encryption Hot!
YANG K, ZHANG J
Journal of Cryptologic Research. 2022, 9 (2): 353-378. ;  doi: 10.13868/j.cnki.jcr.000524
Full Text: HTML (1 KB)  PDF (526 KB)  ( 25 )
Show Abstract ( 62 )
Canetti et al. (CRYPTO 1997) introduced the notion of deniable encryption, which allows a sender or a receiver, that has already performed some encrypted communication, to still produce ``deniable'' randomness (indistinguishable from real randomness) that opens the ciphertext to another message.  So far, designing encryption schemes with dual-scheme deniability (including schemes of two kinds: deniable edit schemes and plan-ahead deniable encryption schemes) seems to be the unique way to achieve high efficiency. However, after more than 20 years of development, the efficiency of existing deniable encryption schemes is still low, even if considering the secret-key setting (i.e., the sender and receiver share a same secret key).  This paper focuses on designing concretely efficient dual-scheme deniable encryption schemes in the secret-key setting.  Specifically, a new receiver-deniable secret key edit scheme is proposed, which reduces the ciphertext length of the scheme proposed by Goldwasser et al. (TCC 2017) by more than 2|CEdit|κ + 3ℓκ bits, where |CEdit| is the number of AND gates for the Boolean circuit with respect to the edit function, ℓ is the length of the edit description and κ  is the security parameter.  Furthermore, the proposed scheme reduces the length of the deniable key from  2(ℓ + κ)κ  bits to only  κ bits.  The efficiency of the proposed scheme is mainly from the new single-key secret-key functional encryption scheme, where an adversary can make at most one secret-key query, and the special encryption and decryption properties are required for designing deniable edit schemes.   Compared with the single-key secret-key functional encryption scheme proposed by Goldwasser et al., the proposed scheme reduces the ciphertext length by more than a half, and simplifies the construction of the special decryption algorithm. Based on the proposed secret-key deniable edit scheme and the hybrid-encryption technique, a plan-ahead secret-key receiver-deniable encryption scheme is designed, which supports t messages to be denied in the plan-ahead setting. This scheme is suitable for encrypting long messages, can achieve O(1) ciphertext rate when t=O(1), and obtains significantly shorter ciphertext than the proposed deniable edit scheme.
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
2022 Vol.9      No.1
2021 Vol.8      No.1      No.2      No.3      No.4      No.5      No.6
2020 Vol.7      No.1      No.2      No.3      No.4      No.5      No.6
2019 Vol.6      No.1      No.2      No.3      No.4      No.5      No.6
2018 Vol.5      No.1      No.2      No.3      No.4      No.5      No.6
2017 Vol.4      No.1      No.2      No.3      No.4      No.5      No.6
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
»

Preface of Special Column on Quantum Computing and Cryptanalysis

GAO F, SUN S W
2021, 8(6): 924-924. Full Text: PDF (236KB) (568)
»

A Survey on Quantum-Secure Symmetric Cryptography

LIANG M, LUO Y Y, LIU F M
2021, 8(6): 947-947. Full Text: PDF (980KB) (890)
»

A Novel Method for Profiling Side-Channel Attacks Against Imbalanced Data

WANG P, ZHENG M C, NAN J H, LUO Z M, HU H G
2021, 8(4): 559-559. Full Text: PDF (1971KB) (686)
»

Fast Software Implementation of ZUC Algorithm

ZHANG Y P, GAO Y, YAN Y, LIU X
2021, 8(3): 401-401. Full Text: PDF (2557KB) (811)
»

Blockchain-Based PEKS System for Reliability-Conscious Data Retrieval

TANG M F, JIANG P, ZHANG Z X, LI Y L, ZHU L H
2021, 8(3): 497-497. Full Text: PDF (11965KB) (841)
»

A Survey of Homomorphic Signature Schemes

WU H L, CHEN W B, GAO C Z, LIU M, LI J
2021, 8(5): 777-777. Full Text: PDF (679KB) (782)
»

Research and Development Trend of Bootstrapping in FHE

LIU Q J, LU X H, LI J, WANG K P
2021, 8(5): 807-807. Full Text: PDF (1184KB) (701)
»

Ring Signature Schemes Based on SM2 Digital Signature Algorithm

FAN Q, HE D B, LUO M, HUANG X Y, LI D W
2021, 8(4): 723-723. Full Text: PDF (1392KB) (781)
»

Research Status and Development Trend of Lattice Sieving

BI L, LU X H, WANG K P
2021, 8(5): 757-757. Full Text: PDF (1362KB) (645)
»

High-Throughput and Low-Power AES-CCM Hardware Implementation

CUI C, ZHAO Y, XIAO Y, LIN W B, XU D
2021, 8(3): 375-375. Full Text: PDF (4936KB) (816)
»

Quantum Implementation of SM4

LIN D, XIANG Z J, ZHANG R L, ZHANG S S, ZENG X Y
2021, 8(6): 1018-1018. Full Text: PDF (6608KB) (653)
»

Preface of Special Column on SM Public-Key Cryptography

WENG J, HUANG X Y, HE D B
2021, 8(4): 683-683. Full Text: PDF (304KB) (592)
»

Polytopic Differential Attack Based on Deep Learning and Its Application

FU C H, DUAN M, WEI Q, WU Q Q, ZHOU R, SU H C
2021, 8(4): 600-600. Full Text: PDF (565KB) (547)
»

On Complex Semantic Searchable Encryptions

LIU J L, QIN J, WANG Q, ZHAO B, ZHANG X, SU Y
2022, 9(1): 22-22. Full Text: PDF (18272KB) (398)
»

Efficient Software Implementations of ZUC-256

BAI L, JIA W Y, ZHU G Z
2021, 8(3): 536-536. Full Text: PDF (3730KB) (656)
»

A Multivariate Polynomial Based Threshold Function Secret Sharing Scheme

LIN C L, LUO J L, ZHANG S Y, WANG H X
2021, 8(3): 548-548. Full Text: PDF (603KB) (611)
»

Key Exfiltration on SM2 Cryptographic Algorithms

HUANG X Y, CHEN R M, WANG Y, XING Q Q
2021, 8(4): 698-698. Full Text: PDF (538KB) (568)
»

An Identity-Based Ring Signature Scheme for SM9 Algorithm

PENG C, HE D B, LUO M, HUANG X Y, LI D W
2021, 8(4): 734-734. Full Text: PDF (618KB) (586)
»

Research on Quantum Algorithm Attack of NTRU Public Key Cryptography

DONG J, CAI B B, WU Y S, GAO F, QIN S J, WEN Q Y
2021, 8(6): 959-959. Full Text: PDF (2578KB) (480)
»

Design and Implementation on Homomorphic Ciphertext Fingerprint Recognition System Based on SEAL Library

YANG Y T, ZHANG Q L, ZHANG Y S, ZUO P L
2021, 8(4): 629-629. Full Text: PDF (4836KB) (585)
»

SM2-Based Multi-Recipient Public-Key Encryption

LAI J Z, HUANG Z A, WENG J, WU Y D
2021, 8(4): 709-709. Full Text: PDF (784KB) (521)
»

A Survey on High-Efficiency Hardware Implementation for Lattice-Based Cryptosystem

HE S Y, LI H, LI F H
2021, 8(6): 1038-1038. Full Text: PDF (590KB) (462)
»

On Watchtower of Payment Channel for Blockchain Light Nodes

XIE Y K, WEI L B, ZHANG C, WANG Q T, SUN Q B
2021, 8(5): 794-794. Full Text: PDF (4232KB) (537)
»

2-Adic Complexity of a Class of Binary Sequences of Length 2p^{2}

KE P H, LU L Y, CHEN Z X
2021, 8(4): 571-571. Full Text: PDF (469KB) (346)
»

Lattice-Based Linkable Threshold Ring Signature in E-Voting

ZHUANG L S, CHEN J, WANG Q Y
2021, 8(3): 416-416. Full Text: PDF (2139KB) (334)
»

Provably-Secure Randomized Block Cipher Approaching to Perfect Secrecy

WANG J B, ZHANG W Z
2021, 8(5): 819-819. Full Text: PDF (1828KB) (359)
»

Quantum Attack on MARS-like Feistel Schemes

QIAN X, YOU Q D, ZHOU X, ZHANG Y, ZHAO X J
2021, 8(3): 431-431. Full Text: PDF (9066KB) (302)
»

Algorithm, Architecture and Hardware Implementation of Stream Cipher

ZHAO S L, LIU L, HUANG H, XU J, LIU Z W, YU B
2021, 8(6): 1057-1057. Full Text: PDF (12025KB) (412)
»

Power Analysis Attack on AES Based on Semi-Supervised Learning

WANG X B, WANG Y J, ZHAO Y, GAO G P, YUAN Q J
2021, 8(4): 668-668. Full Text: PDF (4510KB) (281)
»

NTRU-Type Proxy Re-Encryption Scheme Based on RLWE Difficult Assumption

WANG C, HAN Y L, DUAN X W, LI Y
2021, 8(5): 920-920. Full Text: PDF (548KB) (368)
Journal of Cryptologic Research
 Top Download
»

Overview on Blockchain Consensus Mechanisms

LIU Y Z, LIU J W, ZHANG Z Y, XU T G, YU H
2019, 6(4): 432-432. Full Text: PDF (6101KB) (13660)
»

Survey of Lattice-based Cryptography

WANG X Y, LIU M J
2014, 1(1): 27-27. Full Text: PDF (678KB) (12657)
»

Research on Attribute-based Cryptography

FENG D G, CHEN C
2014, 1(1): 12-12. Full Text: PDF (769KB) (10427)
»

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) (9685)
»

Research on White-box Cryptography

LIN T T, LAI X J
2015, 2(3): 267-267. Full Text: PDF (333KB) (9432)
»

Secret Key Extraction in Wireless Channel

LI G Y, HU A Q, SHI L
2014, 1(3): 224-224. Full Text: PDF (1519KB) (6513)
»

Provable Security for Public Key Encryption——Challenges and Approaches

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

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) (6403)
»

From Bilinear Pairings to Multilinear Maps

ZHANG F G
2016, 3(3): 228-228. Full Text: PDF (571KB) (6243)
»

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) (6209)
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
· Academic Review
· Journal of Cryptologic Research is Accepted for Inclusion in Scopus
· Recommended Academic Periodicals and International Conferences List by CACR (2018)
· Journal of Cryptologic Research is included in "CCF Recommended Chinese S&T Journal List"
· Recall Notification
· Call for Papers for Special Column “Blockchain Technique”
· Call for Papers for Special Column “Secure Multi-party Computation”
· Subscription Notification of Journal of Cryptologic Research
· Good News: Journal of Cryptologic Research Successfully Indexed by CSTPCD
· Editor-in-Chief (Expanded) Meeting Held
more>>     
Links
   » CACR
   » MathMagic
   » Journal of Software
Copyright © Journal of Cryptologic Research