Low Complexity Multiplier Based on Dickson Basis Using Efficient Toeplitz Matrix-Vector Product

Author(s):  
Sun-Mi PARK ◽  
Ku-Young CHANG ◽  
Dowon HONG ◽  
Changho SEO

Identification is one of the important concerns of information security, that is widely used in our daily e-systems to approve authorised users. With the advent of quantum computers, development of quantum secure identification schemes is essential. In this paper, we give the implementation details of quantum secure Kawachi’s and Cayrel’s identification schemes performed in JavaScript. The hardness of these schemes is based on lattice-based problem SIS in post-quantum cryptography, which requires matrix-vector product operations for its execution. It’s important that for efficient implementation choosing an algorithm with low complexity needs more careful. Therefore, in identification schemes chosen for this study, we use algorithms specific to those schemes’ parameter properties. Then, we carry out matrix by sparse vector and sparse matrix by vector product operations.We provide experimental results of both standard and property-specific algorithms’ execution with their comparison. According to the experimental results, we receive improvements in the specific implementations.


2016 ◽  
Vol 65 (1) ◽  
pp. 332-333 ◽  
Author(s):  
Sun-Mi Park ◽  
Ku-Young Chang ◽  
Dowon Hong ◽  
Changho Seo

Sign in / Sign up

Export Citation Format

Share Document