Information Security and Cryptology - ICISC 2015
18th International Conference, Seoul, South Korea, November 25-27, 2015, Revised Selected Papers
Page
%P
-
Article
Open AccessThe Korean undiagnosed diseases program phase I: expansion of the nationwide network and the development of long-term infrastructure
Phase I of the Korean Undiagnosed Diseases Program (KUDP), performed for 3 years, has been completed. The Phase I program aimed to solve the problem of undiagnosed patients throughout the country and develop i...
-
Article
The number of representations of integers by 4-dimensional strongly N-modular lattices
In this article, we prove that a space of cusp forms of weight 2 with level N and real character \(\chi \)
-
Article
Open AccessPolymyoclonus aggravated by neck flexion as the isolated presenting symptom of Hirayama disease: case report
We report a rare case of an 18-year-old male with unilateral hand tremor who was finally diagnosed with Hirayama disease (HD).
-
Article
Partially APN Boolean functions and classes of functions that are not APN infinitely often
In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition. We connect this notion to the known conjecture that A...
-
Article
Representations of Bell-Type Quaternary Quadratic Forms
Let f be a quaternary quadratic form and let r(n, f) be the number of representations of an integer n by f. A quaternary quadratic form f is said to be a Bell-type quaternary quadratic form if f is isometric to ...
-
Article
On the Cipolla–Lehmer type algorithms in finite fields
In this paper, we present a refinement of the Cipolla–Lehmer type algorithm given by H. C. Williams in 1972, and later improved by K. S. Williams and K. Hardy in 1993. For a given r-th power residue ...
-
Book and Conference Proceedings
-
Article
New cube root algorithm based on the third order linear recurrence relations in finite fields
In this paper, we present a new cube root algorithm in the finite field \(\mathbb {F}_{q}\) ...
-
Chapter and Conference Paper
An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm
Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic Curve Cryptosystems. At CHES 1999, Tenca and Koç introduced a now-classical arc...
-
Article
Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields
Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast e...
-
Chapter and Conference Paper
Efficient Linear Array for Multiplication over NIST Recommended Binary Fields
We propose a new linear array for multiplication in GF(2 m ) which outperforms most of the existing linear multipliers in terms of the area and time complexity. Moreover we will ...
-
Chapter and Conference Paper
Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2 m ) Using LSB First Algorithm
The two dimensional systolic array for multiplication in binary field GF(2 m ) with LSB (Least Significant Bit) first algorithm proposed by Yeh et al. has the unfavorable propert...
-
Chapter and Conference Paper
New Architecture for Multiplication in GF(2 m ) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography
We propose a new linear multiplier which is comparable to linear polynomial basis multipliers in terms of the area and time complexity. Also we give a very detailed comparison of our multiplier with the normal...
-
Chapter and Conference Paper
Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware
A novel portable hardware architecture for the Elliptic Curve Method of factoring, designed and optimized for application in the relation collection step of the Number Field Sieve, is described and analyzed. A...
-
Chapter and Conference Paper
Signed Digit Representation with NAF and Balanced Ternary Form and Efficient Exponentiation in GF(q n ) Using a Gaussian Normal Basis of Type II
We present an efficient exponentiation algorithm for a finite field GF(q n ) with small characteristic determined by a Gaussian normal basis of type II u...
-
Chapter and Conference Paper
A Novel Arithmetic Unit over GF(2 m ) for Low Cost Cryptographic Applications
We present a novel VLSI architecture for division and multiplication in GF(2 m ), aimed at applications in low cost elliptic curve cryptographic processors. A compact and fast ar...
-
Chapter and Conference Paper
Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields
In this paper, we present a closed formula for the Tate pairing computation for supersingular elliptic curves defined over the binary field ...
-
Chapter and Conference Paper
A New Digit-Serial Systolic Mulitplier for High Performance GF(2 m ) Applications
This paper presents a new digit-serial systolic multiplier over GF(2 m ) for cryptographic applications. The proposed array is based on the most significant digit first (MSD-firs...
-
Chapter
A New Arithmetic Unit in GF(2M) for Reconfigurable Hardware Implementation
In order to overcome the well-known drawback of reduced flexibility that is associated with traditional ASIC solutions, this paper proposes a new arithmetic unit (AU) in GF(2m) for reconfigurable hardware impleme...
-
Chapter and Conference Paper
Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2 m ) for High Speed Cryptographic Processors
Many of the cryptographic schemes over small characteristic finite fields are efficiently implemented by using a trinomial basis. In this paper, we present new linear systolic arrays for multiplication in GF(2 ...
