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
 

2018, 5(2)
HighLights More»   
· Related Randomness Attacks on Quasi-adaptive NIZK for Linear Subspaces Revisited——LIU J H, YU Y, YANG B, WU W Q
· User Authentication and Key Agreement Protocol for Mobile Client-multi-server Environment——LIU B, ZHOU Y Y, HU F, LI F G
· Improved Impossible-differential Cryptanalysis of Reduced-round SKINNY——HONG D, CHEN S Z
· Threshold Ring Signature Scheme Based on Multivariate Public Key Cryptosystems——GUO Q L, XIANG H, CAI B, SANG J, XIANG T
· New Constructions of SD Codes and PMDS Codes with Three or Four Global Parities——RONG X, YANG X L, HU H G
Current Issue Accepted Earlier Issues Top Read Top Downloaded Top Cited
  Journal of Cryptologic Research--2018, 5 (2)   Published: 28 April 2018
Select | Export to EndNote
Related Randomness Attacks on Quasi-adaptive NIZK for Linear Subspaces Revisited Hot!
LIU J H, YU Y, YANG B, WU W Q
Journal of Cryptologic Research. 2018, 5 (2): 101-110. ;  doi: 10.13868/j.cnki.jcr.000223
Full Text: HTML (1 KB)  PDF (1518 KB)  ( 240 )
Show Abstract ( 201 )

Non-interactive zero knowledge proof systems are important tools in cryptographic protocols. Non-interactive zero knowledge proof systems have many applications including digital signatures, public key cryptography, key distribution schemes and so on. Matrix operation has noncommutative property, hence matrix based zero knowledge proof systems have the potential to resist quantum computational algorithm attack. At EUROCRYPT 2015, Eike Kiltz et al. proposed clean, simple quasi-adaptive non-interactive zero-knowledge(QANIZK) constructions for linear spaces, which were also extend to linearly homomorphic structure-preserving signatures.  This paper introduces a related randomness attack. In this attack on the signature scheme, an adversary can manipulate the signing key and obtain forged signatures.  This paper also describes the attack for the QANIZK with adaptive soundness for linear spaces, simple QANIZK with adaptive one-time simulation soundness, and QANIZK construction. In addition, this paper also gives a detailed analysis on the attack and the corresponding algorithmic description, efficiency analysis, and attack success probability. At the end of the paper, some concluding remarks and discussion about some possible lines of future work are presented.

User Authentication and Key Agreement Protocol for Mobile Client-multi-server Environment Hot!
LIU B, ZHOU Y Y, HU F, LI F G
Journal of Cryptologic Research. 2018, 5 (2): 111-125. ;  doi: 10.13868/j.cnki.jcr.000224
Full Text: HTML (1 KB)  PDF (2952 KB)  ( 201 )
Show Abstract ( 175 )

With the rapid development of E-commerce, network service providers usually provide users with a wide range of services running on different servers. Thus, multi-server model has been widely used. Meanwhile, more and more people access network services more quickly through the mobile phones or other mobile devices, this is the current mobile client-multi-server model which has been very popular. On one hand, mobile devices bring convenience to our lives. On the other hand, the openness of mobile Internet makes its security issues more serious. It is necessary to design a user authentication and key agreement protocol for the mobile client-multi-server model. However, compared with personal computers, mobile devices have resource-constrained features. So how to design a protocol that combines security and efficiency is not an easy task. In order to solve this problem, this study proposes a user authentication and key agreement protocol under the mobile client-multi-server model. Certificateless public key cryptography can solve the problem of certificate management in traditional public key systems and the inherent key escrow problem in identity-based public key cryptography, it has the advantages of both high efficiency and security. In addition, the mobile devices have the characteristics of resource constraints, so the certificateless public key cryptography is very suitable for designing a security protocol for mobile devices which have limited resources. In this paper, it is proved that the proposed protocol can provide mutual authentication and secure key agreement services in the random oracle model. Compared with other protocols of the same type, the proposed protocol in this paper has a better computational efficiency.

Improved Impossible-differential Cryptanalysis of Reduced-round SKINNY Hot!
HONG D, CHEN S Z
Journal of Cryptologic Research. 2018, 5 (2): 126-139. ;  doi: 10.13868/j.cnki.jcr.000225
Full Text: HTML (1 KB)  PDF (3231 KB)  ( 254 )
Show Abstract ( 137 )

 SKINNY is a new family of lightweight AES-like tweakable block ciphers proposed by Beierle et al. at CRYPTO 2016. It is one of the proposals following the Tweakey framework, and can be divided into 6 different versions based on the tweakey size and block size. This paper evaluates the security of SKINNY against impossible-differential analysis under single-key conditions. First, we found 16 truncated impossible differentials with the longest length of SKINNY that reaches 11 rounds by using miss-in-the-middle technique, when there is one active cell in the input and output of the distinguisher. Second, we choose one of the truncated impossible differentials and present an impossible-differential analysis on 20-rounds of SKINNY-64-128 under the single-key conditions. We utilize the properties of the S-box difference and the properties of the Mixcolumn operation of SKINNY to perform key guessing attack. By using the "periodical property" in the tweakey schedule, we derive some linear relationships between subtweakeys, and reduce the number of subtweakeys to guess during the analysis from 45 to 33.  Finally, the parallel attack technique and early abort technique are used to effectively reduce the time complexity of the attack. Our attack requires $2^{29}$ chosen plaintexts and $2^{94}$ nibbles of memory and performs $2^{119.3}$ SKINNY encryptions. Compared with the existing results of impossible differential analysis on SKINNY, the number of chosen plaintexts and time complexity are both reduced.

Threshold Ring Signature Scheme Based on Multivariate Public Key Cryptosystems Hot!
GUO Q L, XIANG H, CAI B, SANG J, XIANG T
Journal of Cryptologic Research. 2018, 5 (2): 140-150. ;  doi: 10.13868/j.cnki.jcr.000226
Full Text: HTML (1 KB)  PDF (1262 KB)  ( 134 )
Show Abstract ( 127 )

Multivariate public-key cryptosystems (MPKCs) are the main candidates of post-quantum cryptosystems. At present, most of multivariate encryption schemes have security problems, while there are many secure and efficient signature schemes. However, less researches are conducted on multivariate signature schemes such as threshold ring signature, blind signature, group signature, and so on. The ring signature scheme based on multivariate public key cryptosystems first proposed by Shangping Wang et al. in 2011 has high efficiency. Threshold ring signature scheme ensures at least $t$ members of a group to sign a message without revealing the identity of the signers. In this study, by combining the characteristics of ring signature scheme proposed by Shangping Wang et al., we propose a threshold ring signature scheme based on MPKCs. The scheme uses the idea of fair partition to split a ring into $t$ disjoint sub-rings repeatedly and form an $(n,t)$-complete partitioning system. When signing, it needs to compute the signature of each sub-rings, then concatenate the signatures to form a ring-like mechanism. Our scheme is a threshold ring signature scheme for multivariate bipolar systems, which can resist the attacks of quantum computers. Analysis shows that, it satisfies the completeness and anonymity of threshold ring signatures. Furthermore, the new scheme is proven to achieve the unforgeability under known attacks against MPKCs.

New Constructions of SD Codes and PMDS Codes with Three or Four Global Parities Hot!
RONG X, YANG X L, HU H G
Journal of Cryptologic Research. 2018, 5 (2): 151-166. ;  doi: 10.13868/j.cnki.jcr.000227
Full Text: HTML (1 KB)  PDF (1398 KB)  ( 59 )
Show Abstract ( 90 )

Erasure codes used in storage systems are designed to tolerate the failures of entire disks. However, the most common type of failures is the mode of disk failures accompanied by sector failures. Blaum et al. proposed SD codes and PMDS codes for this kind of general failures. SD codes and PMDS codes consume far less storage resources than traditional erasure codes used in RAID storage structure. It has been an open problem for some years to construct SD codes and PMDS codes with good fault tolerance capability. The constructions of SD codes and PMDS codes are mainly based on parity check matrices or generator matrices. However, the local parity number $m$ and the global parity number $s$ are limited. In known constructions of SD codes and PMDS codes based on parity check matrices, if the global parity number $s=3$ or 4, the local parity number $m$ has to satisfy  $m\leqslant2$; if the local parity number $m\geqslant1$, the global parity number $s$ has to satisfy $s\leqslant2$. In this paper, we present a new construction of SD codes and PMDS codes based on parity check matrices with $m\geqslant1$ and $s=3$, which means better fault tolerance capability. For SD codes, so far the best construction based on generator matrices has parameters up to $m\geqslant1$ and  $s=3$. In this paper, we present a new construction of SD codes with $m\geqslant1$ and $s=4$.

ZUC-256 Stream Cipher Hot!
Design Team
Journal of Cryptologic Research. 2018, 5 (2): 167-179. ;  doi: 10.13868/j.cnki.jcr.000228
Full Text: HTML (1 KB)  PDF (1448 KB)  ( 304 )
Show Abstract ( 240 )

To be well adapted to the 5G communications and the post-quantum cryptography era, we propose the ZUC-256 stream cipher in this paper, a successor of the previous ZUC-128 stream cipher used in the 3GPP confidentiality and integrity algorithms 128-EEA3 and 128-EIA3 which is highly compatible with the ZUC-128 stream cipher. The aim is a new stream cipher that offers the 256-bit security for the upcoming applications in 5G. For the authentication, various tag sizes are supported with the IV-respecting restriction.

Preface Hot!
Journal of Cryptologic Research. 2018, 5 (2): 180-181. ;  doi: 10.13868/j.cnki.jcr.000229
Full Text: HTML (1 KB)  PDF (344 KB)  ( 160 )
Show Abstract ( 213 )
Research and Progress of Order Preserving Encryption Hot!
GUO J J, MIAO M X, WANG J F
Journal of Cryptologic Research. 2018, 5 (2): 182-195. ;  doi: 10.13868/j.cnki.jcr.000230
Full Text: HTML (1 KB)  PDF (1226 KB)  ( 211 )
Show Abstract ( 239 )

The new term of cloud computing evolves from several concepts such as distributed computing, parallel computing, and grid computing, and achieves the long dreamed vision of computing as an infrastructure. With the rapid development of cloud computing, an increasing number of users prefer to outsource data to the cloud in order to mitigate the burden of local storage. Because the cloud server is untrusted, data should be encrypted before outsourcing to protect the confidentiality. However, the traditional encryption scheme destroys the order property which enables the range query. Order preserving encryption (OPE) is an encryption scheme where the sort order of ciphertexts match the sort order of the corresponding plaintexts. It can protect the confidentiality of data and  allow  other applications to process queries over encrypted data efficiently. The best possible security of OPE is IND-OCPA which says the encryption schemes reveal nothing except the order of plaintexts. Recently, the design of OPE gets more and more diversified. Numerous OPE schemes based on data structure have been proposed to improve the efficiency and usability. This paper first reviews the development history of OPE and an expansion order revealing encryption (ORE), discusses the security and practical of these schemes, and introduces some latest research achievements. This paper also presents some problems need to be solved in this direction. Finally, an attempt is given to foresee the future research directions in OPE.

Secure Similarity Search Based on Locality Sensitive Hashing Hot!
WU Jin, PENG Yan-Guo, CUI Jiang-Tao
Journal of Cryptologic Research. 2018, 5 (2): 196-205. ;  doi: 10.13868/j.cnki.jcr.000231
Full Text: HTML (1 KB)  PDF (2924 KB)  ( 93 )
Show Abstract ( 129 )

With the continuous development of cloud computing technology, the searchable encryption scheme attracts much attention. The traditional searchable encryption schemes only handle exact query matching but not similarity matching. However, the similarity search has a better application prospect in practice. In particular, the similarity search scheme still returns the correct result when the input search term is misspelled. In the meantime, existing similarity searchable encryption schemes result in reduced search precision. In order to solve the problem that the precision of similarity search over encrypted data is not high, this study proposes a secure similarity search scheme based on locality sensitive hashing. Firstly, the locality sensitive hashing is used to quantize the original data into compound hash keywords, and the security index is constructed by using the quantitative results and symmetric encryption. Then, we introduce a metric based on compound hash keys to design a reasonable and efficient strategy to locate candidates. At the same time, we optimize the way of quantifying the candidate set so as to select the most similar result from the candidate set. Using the above method of locating and selecting a candidate set can ensure both the search efficiency and the precision of the result. This paper theoretically proves that the scheme meets the necessary security requirements. Finally, the scheme is applied to real datasets, the experimental results demonstrate the effectiveness of the scheme, namely the search precision has improved obviously.

Secure Data Acquisition Method among Multi-hop Transmission Environments Hot!
LIU Z, HAN Y L, YANG X Y, PAN F
Journal of Cryptologic Research. 2018, 5 (2): 206-217. ;  doi: 10.13868/j.cnki.jcr.000232
Full Text: HTML (1 KB)  PDF (1536 KB)  ( 65 )
Show Abstract ( 121 )

 Compressed sensing can efficiently accomplish data acquisition and eliminate the ``hot spot'' phenomenon in distributed multi-hop networks. However, it cannot provide security protection for data acquisition. Compressed sensing symmetric cryptosystem requires encryption and decryption parties to share the secret keys in advance, needs a secure channel to update the keys and transmit the signal energy during each encryption, and is vulnerable to collusion attacks. In order to solve the problem of data acquisition security in distributed environments, this study extends compressed sensing symmetric encryption (CSSE) to the case of public key, proposes a new cryptographic primitive-compressed sensing public key encryption (CSPKE), defines CSPKE encryption model, and presents a concrete CSPKE algorithm by combing a hard problem on lattices with compressed sensing, proves its indistinguishability against chosen plaintext attack (IND-CPA) on standard model based on the learning with errors (LWE) assumptions. This algorithm makes good use of the matrix feature of lattice cryptogram and well preserves the linear structure of CS, which makes it possible to fuse compressed measurement with encryption in the same step, so it can be very suitable for data secure acquisition in multi-hop environments. In distributed multi-hop environments, CSSE may be difficult in secret key distribution and storage, requires a secure channel to transmit signal energy in every encryption and is vulnerable to collusion attacks. CSPKE compensates the shortcomings of CSSE by adding a little communication cost.

Secure Skyline Query Processing over Location-based Data Hot!
WANG W G, LI H
Journal of Cryptologic Research. 2018, 5 (2): 218-230. ;  doi: 10.13868/j.cnki.jcr.000233
Full Text: HTML (1 KB)  PDF (4441 KB)  ( 73 )
Show Abstract ( 130 )

As an important means of multi-objective optimization, the research of Skyline computation has been a hotspot of current research. However, most of the research focuses on how to improve the efficiency of Skyline computing, the security threat to the privacy of data providers and users caused by data leakage of cloud computing is often neglected. The secure computing problem is a new challenge for Skyline computing. Existing solutions for Skyline secure computing require more than one cloud server to cooperate with each other, and there is a risk of collusion between multiple cloud servers, while the use of multiple servers can greatly increase the computing cost. In order to solve the above problems, this paper presents a Skyline secure computing scheme based on location information. This scheme needs a cloud server and a trusted auxiliary computing server, and the location information-based Skyline computing can be efficiently and safely implemented by using an order preserving encryption algorithm and an R*-tree structure. The location information refers to that the target of Skyline computing is two-dimensional, which is very common in practical situations. The comprehensive analysis shows that this scheme can achieve safe Skyline computing. Compared with the Skyline computing for plaintexts, this scheme can respond quickly to the user's query request.

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
2018 Vol.5      No.1
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 on Homomorphic Encrpytion

CHEN K F, JIANG L Z
2017, 4(6): 560-560. Full Text: PDF (351KB) (1308)
»

Application of (Fully) Homomorphic Encryption for Encrypted Computing Models

JIANG L Z, XU C X, WANG X F, CHEN K F, WANG B C.
2017, 4(6): 610-610. Full Text: PDF (5733KB) (1321)
»

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

An Efficient Identity-based Ring Signature Scheme over a Lattice

JIA X Y, HE D B, XU Z Y, LIU Q
2017, 4(4): 404-404. Full Text: PDF (1576KB) (580)
»

Preface on Post-quantum Cryptography

YU Y
2017, 4(5): 473-473. Full Text: PDF (140KB) (726)
»

Key Update and Trusted Positioning System Based on Blockchain

LI D W, LIU J W, GUANG Z Y, QIN Y Y, WU Q H
2018, 5(1): 42-42. Full Text: PDF (1140KB) (474)
»

A Secure Mutual Authentication Protocol Based on SRAM PUF

LIU D, GUO L M, YU J, WANG L H, SHAN W J
2017, 4(4): 371-371. Full Text: PDF (11607KB) (668)
»

Post-quantum Key Exchange from Lattice

LIU Y M, LI X X, LIU H L
2017, 4(5): 497-497. Full Text: PDF (548KB) (572)
»

Research Advances on Authenticated Encryption Algorithms#br#

WU W L
2018, 5(1): 82-82. Full Text: PDF (331KB) (529)
»

Efficient,Verifiable and Secure Outsourcing of Matrix Multiplication

WU D D, LAI Q Q,YANG B
2017, 4(4): 332-332. Full Text: PDF (1314KB) (569)
»

Overview on Fully Homomorphic Encryption

LI Z P, MA C G, ZHOU H S
2017, 4(6): 578-578. Full Text: PDF (746KB) (510)
»

The Universally Composable Framework of Cryptographic Service APIs

XU K Y, YUAN Q J, TAN L, LU S Q
2017, 4(4): 412-412. Full Text: PDF (2138KB) (445)
»

A Survey on the Construction of Hash Proof Systems based on Lattices

LAI Q Q, YANG B, YU Y, CHEN Y, GU X Y
2017, 4(5): 484-484. Full Text: PDF (1015KB) (510)
»

ZUC-256 Stream Cipher

Design Team
2018, 5(2): 179-179. Full Text: PDF (1448KB) (301)
»

Research and Progress of Order Preserving Encryption

GUO J J, MIAO M X, WANG J F
2018, 5(2): 195-195. Full Text: PDF (1226KB) (204)
»

Analysis of Lightweight 4*4 MDS Matrices over GL(4, F2)

CAI C L, TANG C M, YU Y Y, GAO L, LAI Y
2017, 4(4): 383-383. Full Text: PDF (1362KB) (422)
»

Lightweight Hash Function LHash Fast Software Implementation

LANG Huan, ZHANG Lei, WU Wen-Ling
2017, 4(4): 359-359. Full Text: PDF (22838KB) (351)
»

Biclique Cryptanalysis of Lightweight Block Cipher PRINCE

YUAN Z, PENG Z
2017, 4(6): 527-527. Full Text: PDF (3937KB) (337)
»

Analysis on Photon-number-splitting Attack Against Decoy-state Quantum Key Distribution Schemes

LI H X, CHI Y G, HAN Y, YAN B, WANG W
2018, 5(1): 12-12. Full Text: PDF (4140KB) (367)
»

Preface

2018, 5(2): 181-181. Full Text: PDF (344KB) (156)
»

Distinguisher Attack on Reduced-round Keccak

LIU X G, ZHOU J, YU H B
2017, 4(5): 446-446. Full Text: PDF (1911KB) (292)
»

Digital Certificate Scheme Based on Lattice Signature Algorithm

LI Z C, LIANG L, SUN Y F
2018, 5(1): 20-20. Full Text: PDF (1229KB) (277)
»

Horizontal Analysis and its Extended Methods Used for Single Trace Side-channel Attack

ZHANG Y W, WANG Y J, TANG Y, ZHANG L L
2017, 4(4): 391-391. Full Text: PDF (18574KB) (250)
»

Related Randomness Attacks on Quasi-adaptive NIZK for Linear Subspaces Revisited

LIU J H, YU Y, YANG B, WU W Q
2018, 5(2): 110-110. Full Text: PDF (1518KB) (233)
»

Preface

HU L
2018, 5(1): 69-69. Full Text: PDF (121KB) (249)
»

Efficient Homomorphic Encryption and Its Application

YANG H M, JIN B L, CHEN C, WU X Y
2017, 4(6): 619-619. Full Text: PDF (1074KB) (270)
»

User Authentication and Key Agreement Protocol for Mobile Client-multi-server Environment

LIU B, ZHOU Y Y, HU F, LI F G
2018, 5(2): 125-125. Full Text: PDF (2952KB) (195)
»

Cube Attack on Round-reduced Fruit

SUN Y S
2017, 4(6): 536-536. Full Text: PDF (485KB) (222)
»

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
2017, 4(5): 471-471. Full Text: PDF (4689KB) (172)
»

Fair Secret Sharing Scheme with Unconditional Security

ZHANG B H, XIE X J, TANG Y S
2017, 4(6): 544-544. Full Text: PDF (766KB) (240)
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) (6765)
»

Survey of Lattice-based Cryptography

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

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

Research on White-box Cryptography

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

Secret Key Extraction in Wireless Channel

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

Provable Security for Public Key Encryption——Challenges and Approaches

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

Cryptanalysis of Quantum Cryptographic Protocols

WEN Q Y, QIN S J, GAO F
2014, 1(2): 210-210. Full Text: PDF (866KB) (3387)
»

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

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

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) (2718)
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
· 2018 Open Fund of State Key Laboratory of Cryptology Now Release
· Call for Papers of 2018 Conference on Identification, Certification and Authentication (CICA2018)
· Call for Papers for Special Column “Blockchain Technique”
· Call for Papers for Special Column “Secure Multi-party Computation”
· Call for Papers of 2018 CACR Conference on Cryptology Algorithm
· Call for Papers of 2018 CACR Conference on Cryptology Test and Evaluation
· Subscription Notification of Journal of Cryptologic Research
· Good News: Journal of Cryptologic Research Successfully Indexed by CSTPCD
· Second Notice on the 2017 Annual Conference of Chinese Association for Cryptologic Research
· Editor-in-Chief (Expanded) Meeting Held
more>>     
Links
   » CACR
   » MathMagic
   » Journal of Software
Copyright © Journal of Cryptologic Research