Hyun-Sung Kim's research while affiliated with Kyungil University and other places

Publications (52)

Article
A secure data gathering in a Wireless Sensor Network(WSN) has given attention to one of security issues. In general, the process of secure data gathering causes difficulties: one process is exchanging the secured data and the other is constructing secured data path. The previous studies have been resolving the difficulties in terms of two problems:...
Article
Recently, many works have been focusing on solving the problem of privacy protection at link-layer level by randomizing all bits of the frames at link layer so that it makes difficult for unintended recipients to associate sequences of packets to their source transmitters. Most existing schemes however assume either the pre-setup for shared secrets...
Conference Paper
Authenticated key agreement protocol is one of the most convenient ways to provide secure authentication and key agreement for the communication between the user and the service provider over insecure network. Recently, Lee proposed an attributes-based authenticated key agreement protocol over home network, which is based on the attribute based cry...
Article
Nodes in a sensor network may be lost because of the power exhaustion problem or malicious attacks. Thereby new node deployment is necessary in the sensor network. Huang recently proposed a novel access control protocol (NACP) based on the elliptic curve cryptography and the hash chain. She claimed that NACP can easily add new nodes and can resist...
Article
Finite field operations have been widely used in the data communication security applications. This paper proposes two AB2 multipliers based on the cellular automata over finite field. They deploy the mixture advantages in the perspective of both in area and time complexity by applying the property of irreducible all one polynomial as a modulus. Fi...
Article
Most of clustering schemes focusing on the energy efficiency have only a cluster head in each cluster, thus the energy consumption of cluster head in a cluster can rapidly increase. To reduce the energy consumption, recently, the dual-layered clustering which is separated a cluster ranges into two parts, i.e., data aggregation layer and data transm...
Conference Paper
Generally, a suffix tree is an efficient data structure since it reveals the detailed internal structures of given sequences within linear time. However, it is difficult to implement a suffix tree for a large number of sequences in the ubiquitous devices because of the memory constraints. Therefore, in order to compare multi-megabase genomic DNA se...
Conference Paper
This paper proposes a generalized bitmap routing protocol, which finds the efficient routing path by minimizing the network. Jung in proposed a bitmap routing protocol for sensor networks. His routing protocol uses a bitmap table to represent the connection information between nodes. However, it has a problem that the table size is depends on the n...
Article
This paper presents a new digit level LSB-first multiplier for computing a modular multiplication and a modular squaring simultaneously over finite field GF(). To derive digit level architecture when digit size is set to L, the previous algorithm is used and index transformation and merging the cell of the architecture are proposed. The proposed ar...
Article
This paper presents two bit-serial modular multipliers based on the linear feedback shift register using an irreducible all one polynomial (AOP) over GF(2m). First, a new multiplication algorithm and its architecture are proposed for the modular AB multiplication. Then a new algorithm and architecture for the modular AB2 multiplication are derived...
Conference Paper
The modular multiplication is known as an efficient basic operation for public key cryptosystems over GF(2 m ). Various systolic architectures for performing the modular multiplication have already been proposed based on a standard basis representation. However, they have high hardware complexity and long latency. Thereby, this paper presents a new...
Article
An modular operation is an efficient basic operation for the public key cryptosystems and various systolic architectures for modular operation have been proposed. However, these architectures have a shortcoming for cryptographic applications due to their high area complexity. Accordingly, this paper presents an partitioned systolic modular multipli...
Article
Recently, Kim et al. proposed ID-based authentication schemes using smartcards and fingerprints. However, Scott showed that they were vulnerable to the passive eavesdropping attack. Thereby, this paper proposes an enhanced ID-based authentication scheme to solve the problems in Kin et al. scheme. Especially, the proposed scheme solves the ID repair...
Article
This paper proposes an efficient remote user authentication scheme using smart cards, which does not require password verification tables. To withstand message replay attacks, the proposed scheme uses random nonces in place of timestamps. So, it does not require synchronized clocks. In our scheme, users are able to freely choose and change their pa...
Article
So far, there have been several key agreement protocols for three-parties, in which two clients establish a common session key through a authentication server. Most of those protocols require to use server’s public key to prevent password guessing attacks. However, because clients need to verify and safely keep the server’s public key, the protocol...
Conference Paper
This paper proposes a new algorithm and an architecture for it to compute the modular multiplication over GF(2 m ). They are based on the standard basis representation and use the property of irreducible all one polynomial as a modulus. The architecture, named SSM(Semi-Systolic Multiplier) has the critical path with 1-DAND+1-DXOR per cell and the l...
Article
Recently, Lee and Lee showed that Hsu et al.’s authenticated key agreement scheme is vulnerable to the modification attack and then proposed an improved scheme. In this paper, we argue that the Lee and Lee’s scheme cannot withstand the password guessing attack. Hence, we propose an improved scheme to solve this problem.
Article
Recently, C. Hsu et al. [ibid. 142, 305–308 (2003; Zbl 1026.94009)] showed that W. Ku and S. Wang’s authenticated key agreement protocol [Cryptanalysis of modified authenticated key agreement protocol, Electronic Lett. 35, 1770–1771 (2000)] is vulnerable to the modification attack and then proposed an improved protocol, called the HWWM protocol. In...
Article
In 2000, Sun proposed an efficient remote user authentication scheme using smart cards. Later, Chien et al. pointed out that Sun's scheme does not provide the mutual authentication between the user and the server and allow users to freely choose password themselves. Chien et al. further proposed a new efficient and practical solution to solve the p...
Article
This paper presents bit-serial arithmetic architectures for GF(2m) based on an irreducible all one polynomial. First, modular multiplier and a squarer are designed with significantly less hardware complexity than previous architectures. Then, two arithmetic architectures are proposed based on the modular multiplier and squarer. They can be used as...
Article
In 2000, since Hwang and Li proposed a remote user authentication scheme without password table using smart cards based on ID-based cryptosystems, the related works have been done. In 2002, Chien et al. proposed an efficient and practical remote user authentication scheme providing the many merits. However, Hsu showed that Chien et al.'s scheme is...
Article
In 2000, Hwang and Li proposed a new remote user authentication scheme using smart cards. However. Chan and Cheng showed that the scheme is vulnerable to the impersonation attack. Later, Shen et al. showed a different type of impersonation attack on the scheme and presented a modified scheme to withstand these attacks. Recently, Awasthi and LaI pre...
Conference Paper
In this paper, we present a new password-based authenticated key agreement protocol called PAKA, which provides mutual authentication and key agreement over an insecure channel between two parties knowing only a small password having low entropy. We then extend PAKA to a protocol called PAKA-X, in which the client uses a plaintext version of the p...
Article
Recently, Lee et al. proposed an improved scheme, called LLH scheme, to solve a security problem of guessing attack in the Peyravian-Zunic password scheme. The scheme comprises a password authentication protocol and a password change protocol. However, we discuss that the LLH scheme has several security problems: the scheme is still vulnerable to t...
Article
This paper proposes two ID-based password authentication schemes, which does not require a dictionary of passwords or verification tables, with smart card and fingerprint. In these schemes, users can change their passwords freely. For a network without synchronization clocks, the proposed nonce-based authentication scheme can withstand message repl...
Conference Paper
This paper proposes two new multipliers based on cellular automata over finite field. Finite fields arithmetic operations have been widely used in the areas of data communication and network security applications. First, a multiplier with generalized irreducible polynomial is implemented with MSB-first fashion. Then, new algorithm and architecture...
Conference Paper
This paper presents a novel method for the parallelization of the modular multiplication algorithm in the Residue Number System (RNS). The proposed algorithm executes modular reductions using a new lookup table along with the Mixed Radix number System (MRS) and RNS. MRS is used because algebraic comparison is difficult in RNS, which has a non-weig...
Article
Recently, Yeh and Sun proposed a simple authenticated key agreement protocol resistant to password guessing attacks called SAKA that is simple and cost-effective. And they provided a formal proof of security to show its strength against both passive and active adversaries. Compared with the previous well-known protocols, SAKA has less number of ste...
Article
This paper presents a new multiplication algorithm and, based on this algorithm, proposes a hardware architecture, called Modified Inner-Product Multiplier (MIPM), which computes AB multiplication based on a Linear Feedback Shift Register (LFSR)
Article
This paper presents a new multiplication algorithm and, based on this algorithm, proposes a hardware architecture, called Modified Inner-Product Multiplier (MIPM), which computes AB 2 multiplication based on a Linear Feedback Shift Register (LFSR). The algorithm is based on the property of the irreducible all one polynomial (AOP) over the finite fi...
Conference Paper
Modular exponentiation in a finite field is the basic computation involved in most public key crypto systems, such as Diffie-Hellman key exchange, ElGamal, etc. The current paper presents a new parallel architecture whereby the modular multiplication and squaring can be processed simultaneously in GF(2 m ) in m clock cycles using a cellular automat...
Conference Paper
This paper proposes a new parallel algorithm and architecture for two modular multiplications over GF(2m). The algorithm uses the property of irreducible all one polynomial as a modulus and computes two modular multiplications in parallel. The architecture is based on cellular automata and has smaller area and time complexity than previous architec...
Conference Paper
Finite field arithmetic operations have been widely used in the areas of data communication and network security applications, and high-speed and low-complexity design for finite field arithmetic is very necessary for these applications. This paper presents a new algorithm and architecture for the power-sum operation (AB 2+C over GF(2m) using the s...
Conference Paper
This paper presents bit-serial arithmetic architectures for GF(2m) based on an irreducible all one polynomial. First, modular multiplier and squarer are designed. Then, two arithmetic architectures are proposed based on the modular multiplier and squarer. Proposed architectures hybrid the advantages of hardware and time complexity from previous arc...
Conference Paper
This paper presents a new exponentiation architecture and multiplier/squarer for GF(2m), which uses a standard basis representation. The proposed multiplier/squarer is used as kernel architecture of exponentiation. Although the proposed multiplier/squarer computes the multiplication and squaring operations at the same time in GF(2m), the common par...
Article
This letter proposes a partitioned systolic array for MSB-first approach multiplication in GF(2m). When compared to the related multiplier presented by Wang, the proposed systolic array requires a significantly smaller number of basic cells. It requires only m/2 basic cells and exhibits the same latency when it has two bands.
Conference Paper
In this paper, we present an efficient fixed-size systolic array for Montgomery's modular multiplication. The array is designed by the LPGS (Locally Parallel Globally Sequential) partition method [14] and can perform efficiently modular multiplication for the input data with arbitrary bits. Also, we address a computation pipelining technique, whic...
Conference Paper
This paper presents a partitioned systolic array with an arbitrary number of PEs for MSB-first approach multiplication in GF(2<sup>m</sup>) based on the polynomial representation. As compared to the related multipliers presented by Wang et al. the proposed partitioned systolic array requires significantly small number of basic cells. It requires on...

Citations

... [7,8].Lamport가 1981년 원격 패스워드 인증 기법을 제안한 이래 다양한 보안 기법 및 프로토콜이 연구되었다 [9,10,11,12,13,14,15] (1) GWN은 먼저 타임스탬프의 적법성 |T 1 (1) U i 가 ID i 와 PW i 를 선택하고 난수 b를 생성한 후, 마스크된 패스워드 (masked password) PW i * =h(PW i || b)를 계산하고 안전한 채널을 통해 <ID i , PW i * >를 GWN에게 보낸다. (2) GWN은 v=h(x a ), N i =h(ID i ||PW i * )⊕v, M i =h(PW i * ||v)를 계산하고 v를 데이터베이스에 저장한다. ...
... Basic features of WSNs have limitations on energy, transmission power, memory and computing power. They make WSNs different from the other wireless ad hoc or mesh networks [1][2][3][4][5]. Many security solutions for wireless networks can be applied to WSNs directly. ...
... One of the fundamental problems in the areas of cryptography and communication security is authentication to enable two parties communicating over a public network to establish a high-entropy secret key from their low entropy passwords [1]. Many password based authentication protocols were designed to solve this problem and often showed the security vulnerabilities including password guessing attack, replay attack, insider attack, and many more attacks [2][3][4][5][6][7][8]. ...
... Cellular Automata (CA) have attracted a lot of attention regarding their potential for various applications, such as parallel processing and number theory. CA architecture has been used to design arithmetic Computations that Hua Li and Chang N. Zhang [11] proposed a reconfigurable hybridcrypto architecture with programmable cellular automata, Hyun-Sung Kim and Sung-Woon [2] proposed two AB 2 multipliers based on the cellular automata over finite field, in [1] P.Pal.Choudhury and R.Barua presented a new algorithms based on cellular automata operations for performing fast multiplication and inversion in GF(2"'), Lee Choulhury [10] designed an LSB multiplier based on CA, Kyo-Min Ku [8] described a new parallel architecture for modular multiplication and squaring based on cellular automata, in [12]- [13] Jun-Cheol Jeon proposed an efficient division architecture using restricted irreducible polynomial on ECC based on CA. In [9] Hyun-Sung Kim proposed a new parallel algorithm and architecture for two modular multiplications over GF(2 m ). ...
... In 1989, Itoh and Tsujii [20] designed two low complexity multipliers based on All-One Polynomial (AOP) and the irreducible equally spaced polynomial. Since the introduction of these multipliers, many bit-serial and bit-parallel low complexity multipliers have been proposed for cryptographic applications [9,24252627282930313233. In 1997, Fenn et al. presented two bit-serial multipliers using irreducible All-One Polynomial with a low area complexity [5]. ...
... Huang and K. C. Liu (2008) also proposed another certificate less access control scheme. Soon Kim and Lee (2009) proposed an improved access control scheme after showing the insecurity of Huang (2009)'s scheme against the replay attack. However, Zeng et al. (2010) found some weaknesses in the scheme of Kim and Lee (2009). ...
... Lee et.al [14] presented authentication method based on password and claimed it to be improvement of system proposed by Wu et.al [15]. However Xu et.al [16] pointed out forgery attack on Lee et.al [14] system and password guessing attack on Lee et.al [17]. Song et.al [18] pointed various possible attacks on Xu et.al [16] system and suggested new password based protocol for authentication using smart cards. ...
... One of the fundamental problems in the areas of cryptography and communication security is authentication to enable two parties communicating over a public network to establish a high-entropy secret key from their low entropy passwords [1]. Many password based authentication protocols were designed to solve this problem and often showed the security vulnerabilities including password guessing attack, replay attack, insider attack, and many more attacks [2][3][4][5][6][7][8]. ...
... Actual password's ownership is verified by AS using a technique to resist stolen verifiers attack. But, the copy of verifier table can be stolen from AS database by the attacker [3][4][5]. Variety of verifierbased 3-party authentication methods [3][4][5][6][7] were proposed. In 2005 Lee et al. [4] proposed an efficient verifier-based 3party authentication approach without server's public keys. ...
... With the existing traditional password based security, nowadays various smart device support biometric (fingerprint) based and graphical pattern based authentication for user verification. Many works have been done in the direction of user authentication through memory based [1][2][3][4][5], graphical pattern based [6][7][8], static biometric based [9][10][11][12][13] techniques. Among these most of the memory based techniques are vulnerable to many attacks like password guessing attack, replay attack, modification attack, etc. ...