Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korea Institute of Information Security and Cryptology
Journal Basic Information
Journal DOI :
Korea Institutes of Information Security and Cryptology
Editor in Chief :
Volume & Issues
Volume 12, Issue 6 - Dec 2002
Volume 12, Issue 5 - Oct 2002
Volume 12, Issue 4 - Aug 2002
Volume 12, Issue 3 - Jun 2002
Volume 12, Issue 2 - Apr 2002
Volume 12, Issue 1 - Feb 2002
Selecting the target year
An ID-based entity-authentication and authenicated key exchange protocol with ECDSA
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 1, 2002, Pages 3~10
This paper proposes an ID-based entity-aunthentication and authenticated key exchange protocol with ECC via two-pass communications between two parties who airs registered to the trusted third-party KC in advance. The proposed protocol developed by applying ECDSA and Diffie-Hellman key exchange scheme to the ID-based key distribution scheme over ECC proposed by H. Sakazaki, E. Okamoto and M. Mambo(SOM scheme). The security of this protocol is based on the Elliptic Curve Discrete Logarithm Problem(ECDLP) and the Elliptic Curve Diffie-Hellman Problem(ECDHP). It is strong against unknown key share attack and it provides the perfect forward secrecy, which makes up for the weakness in SOM scheme,
On Design of the Recoverable Cryptosystem in Public Key Infrastructure
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 1, 2002, Pages 11~20
In 1998, A. Young and M. Yung proposed the auto-recovery auto-certificate cryptosystem in public key infrastructure. We propose the new recoverable cryptosystem in public key infrastructure which is designed with the concept of A. Young et al's auto-recovery auto-certificate cryptosystem. It has the private/public key pairs of the user and the master private/public key pairs of the escrow authority. It is based on RSA cryptosystem and has efficiency and security.
New Cyclic Difference Sets with Singer Parameters Constructed from d-Homogeneous Functions
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 1, 2002, Pages 21~32
In this paper, for any prime q, new cyclic difference sets with Singer parameter equation omitted are constructed by using the q-ary sequences (d-homogeneous functions) of period
-1. When q is a power of 3, new cyclic difference sets with Singer parameter equation omitted are constructed from the ternary sequences of period
-1 with ideal autocorrealtion found by Helleseth, Kumar and Martinsen.
A Method to Enhance the Security of ZKIP with Weak Keys and Its Application
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 1, 2002, Pages 33~42
We present a systematic way to armor a zero-knowledge interactive proof based identification scheme that has badly chosen keys. Keys are sometimes mistakenly chosen to be weak(neither random nor long), and a weak key is often preferred to a strong key so that it might be easy for human to remember. Weak keys severely degrade the security of ZKIP based identification schemes. We show using off-line guessing attack how the weak key threats the security of ZlKIP based identification schemes. For the proper usage of ZKIP, we introduce a specialized form of ZKIP, which has a secret coin-tossing stage. Using the secret coin tossing, a secure framework is proposed for ZKIP based identification schemes with weak key in the ideal cipher model. The framework is very useful in password based authentication and key exchange protocol
McEliece Type PKC Based on Algebraic Geometry Code over Hyperelliptic Curve
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 1, 2002, Pages 43~54
McEliece introduced a public-key cryptosystem based on Algebraic codes, specially binary classical Goppa which have a good decoding algorithm and vast number of inequivalent codes with given parameters. And the advantage of this system low cost of their encryption and decryption procedures compared with other public-key systems specially RSA, ECC based on DLP(discrete logarithm problem). But in , they resent new attack based on probabilistic algorithm to find minimum weight codeword, so for a sufficient security level, much larger parameter size [2048, 1608,81]is required. Then the big size of public key make McEliece PKC more inefficient. So in this paper, we will propose New Type PKC using q-ary Hyperelliptic code so that with smaller parameter(1 over 3) but still work factor as hi인 as McEliece PKC and faster encryption, decryption can be maintained.
A Practical Approach Defeating Blackmailing XTR-version Identification protocol
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 1, 2002, Pages 55~66
Electronic cash system based on anonymous coins have been invented by David Chaum. However, von Solms and Naccache discovered that such anonymous coins also very well suited to support criminals in Blacoailing. In this paper, we suggest a method that a client informs a bank of the information about blackmailing attack by using Schnorr identification protocol of XTR version at the stage of identification, whenever he is blackmailed. In general, blackmailing is the most serious among the various drawbacks of electronic cash system. Especially, blackmiling to be done when the client is kidnapped brings a fatal result to electronic cash system. But if the Schnorr identification protocol of XTR version is used, we can efficiently defeat blackmailing without assumption required in the existing method to defeat blackmailing.
New Block Encryption Algorithm FRACTAL with Provable Security against DC and LC
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 1, 2002, Pages 67~80
In this article, a new block encryption algorithm FRACTAL is introduced. FRACTAL adopts 8-round Feistel structure handling 128 hit inputs and keys. Furthermore, FRACTAL possesses the provable security against DC and LC, which are known to he the most powerful attacks on block ciphers.
An improved method of scalar multiplication on Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic
Journal of the Korea Institute of Information Security and Cryptology, volume 12, issue 1, 2002, Pages 81~88
For efficient implementation of scalar multiplication in Elliptic Curve Cryptosystems over Small Fields of Odd Characterist, robenius endomorphism is useful. We discuss new algorithm for multiplying points on Elliptic Curve Cryptosystems over Small ields. Our algorithm can reduce more the length of the Frobenius expansion than that of Smart.