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 11, Issue 6 - Dec 2001
Volume 11, Issue 5 - Oct 2001
Volume 11, Issue 4 - Aug 2001
Volume 11, Issue 3 - Jun 2001
Volume 11, Issue 2 - Apr 2001
Volume 11, Issue 1 - Feb 2001
Selecting the target year
Single Sing-On System enabling Mutual Authentication in Multi Domain Environments
Journal of the Korea Institute of Information Security and Cryptology, volume 11, issue 5, 2001, Pages 3~16
With the development of Internet, it is widely spreaded to a Intranet based on Internet technology. Intranet is a private, unique network to share the information of organization such as incorporate, research institute and university. With the increase of Intranet using, Intranet environment is developing into Extranet environment which is connected many Intranet. Currently such Intranet and Extranet environments, above all, it is important to solve security problems which can appear through use of information between domains. Thus, in this paper, we propose SSO(Single Sign-on System) model with authorization management and single sign-on operation, and we extend it to enable mutual authentication through inter-working based on PKI(Public Key Infrastructure) in Extranet environments.
Implementation of a pipelined Scalar Multiplier using Extended Euclid Algorithm for Elliptic Curve Cryptography(ECC)
Journal of the Korea Institute of Information Security and Cryptology, volume 11, issue 5, 2001, Pages 17~30
In this paper, we implemented a scalar multiplier needed at an elliptic curve cryptosystem over standard basis in
. The scalar multiplier consists of a radix-16 finite field serial multiplier and a finite field inverter with some control logics. The main contribution is to develop a new fast finite field inverter, which made it possible to avoid time consuming iterations of finite field multiplication. We used an algorithmic transformation technique to obtain a data-independent computational structure of the Extended Euclid GCD algorithm. The finite field multiplier and inverter shown in this paper have regular structure so that they can be easily extended to larger word size. Moreover they can achieve 100% throughput using the pipelining. Our new scalar multiplier is synthesized using Hyundai Electronics 0.6
CMOS library, and maximum operating frequency is estimated about 140MHz. The resulting data processing performance is 64Kbps, that is it takes 2.53ms to process a 163-bit data frame. We assure that this performance is enough to be used for digital signature, encryption & decryption and key exchange in real time embedded-processor environments.
Efficient Public-Key Traitor Tracing with Unlimited Revocation Capability
Journal of the Korea Institute of Information Security and Cryptology, volume 11, issue 5, 2001, Pages 31~42
Two important requirements in broadcast encryption schemes are traitor traceability and revocability. In this paper, we propose a new type of a traitor tracing scheme that can revoke an unlimited number of traitors\` personal keys. Additionally, we propose an efficient and simple method to provide self-enforcement property. We also describe a variant of our scheme of which encryption algorithm is secure against adaptive chosen ciphertext attacks.
Signcryption Schemes with Forward Secrecy
Journal of the Korea Institute of Information Security and Cryptology, volume 11, issue 5, 2001, Pages 43~52
Y. Zheng introduced a new type of cryptograghic primitive as \"signcryption\", which combines a function of digital signature scheme with a symmetric key encryption algorithm. Signcryption doesn\`t only provide authenticity and confidentiality in a single step, but also give more efficient computation than the traditional \"signature-then-encryption\". And C. Gamage proposed a proxy-signcryption that efficiently combines a proxy signature with the signcryption. But, in the proposed signcryption schemes, one who obtains the sender\`s private key can recover the original message of a signcrypted text. That is, forward secrecy is not offered by the signcryption scheme with respect to the sender\`s private key. In this paper, we will propose a modified signcryption of Zheng\`s signcryption and a variant of proxy-signcryption with forward secrecy.ith forward secrecy.
A Study on Electronic Voting Protocol using Bit-Commitment
Journal of the Korea Institute of Information Security and Cryptology, volume 11, issue 5, 2001, Pages 53~62
Fast diffusion of personal computer and network, and developed security technology are augmenting specific gravity of convenient and safe electronic voting system supplementing much problems of existent off-line vote form. But in spite of enlargement of these weight, much limitations are extravagant. Specially, problem that secure voter\`s anonymousness and accuracy of poll can be important urea that judge if electronic voting system can be applied actually. Also, problems such as buying and selling of vote remain to subject that must solve yet. In this paper, we introduce items that is considered to design the safe electronic voting system, and present limitation of electronic polling system announced in . And we propose improvement way. Improved protocol keeping advantages that is presented in , designed to keep away voter\`s anonymousness defamation by conspiracy of Election Administration Committee and Totaling Committee, and block unlawful election intervention as original.
Efficient Architectures for Modular Exponentiation Using Montgomery Multiplier
Journal of the Korea Institute of Information Security and Cryptology, volume 11, issue 5, 2001, Pages 63~74
Modular exponentiation is an essential operation required for implementations of most public key cryptosystems. This paper presents two architectures for modular exponentiation using the Montgomery modular multiplication algorithm combined with two binary exponentiation methods, L-R(Left to Left) algorithms. The proposed architectures make use of MUXes for efficient pre-computation and post-computation in Montgomery\`s algorithm. For an n-bit modulus, if mulitplication with m carry processing clocks can be done (n+m) clocks, the L-R type design requires (1.5n+5)(n+m) clocks on average for an exponentiation. The R-L type design takes (n+4)(n+m) clocks in the worst case.
Attribute Certificate Profile Research
Journal of the Korea Institute of Information Security and Cryptology, volume 11, issue 5, 2001, Pages 75~84
Existent public key certificates provide authentication information through some information on user\`s public key. However, an attribute certificate which stores and manage user\`s attribute information, provides various privilege information such as position, privilege and role. In recent, international organizations establishes standards on attribute certificate, and the researches and developments on attribute certificate have been widely made. In addition it may be expected to be used many real application area requiring for authorization information as well as authentication information. Therefore, this paper considers background and standardization trends of attribute certificate and describes the profile and related techniques of attribute certificate currently established by IETF. In addition, it introduces and access control system using attribute certificate and specifies applications of attribute certificate.
Saturation Attacks on the 27-round SKIPJACK
Journal of the Korea Institute of Information Security and Cryptology, volume 11, issue 5, 2001, Pages 85~96
This paper describes saturation attacks on reduced-round versions of SKIPJACK. To begin with, we will show how to construct a 16-round distinguisher which distinguishes 16 rounds of SKIPJACK from a random permutation. The distinguisher is used to attack on 18(5~22) and 23(5~27) rounds of SKIPJACK. We can also construct a 20-around distinguisher based on the 16-round distinguisher. This distinguisher is used to attack on 22(1~22) and 27(1~27) rounds of SKIPJACK. The 80-bit user key of 27 rounds of SKIPJACK can be recovered with
chosen plaintexts and
Recoverable Password Based Key Exchange Protocol
Journal of the Korea Institute of Information Security and Cryptology, volume 11, issue 5, 2001, Pages 97~104
In this paper, we propose Recoverable Password Based Key Exchange Protocol(RPKEP). RPKEP has user who has password, server which share the secret key information with user, and password recovery agency(PRA) which help to recover the user\`s password. Proposed protocol has some advantages that it is secure against off-line dictionary attack which is considered most important in password based key exchange protocol and suer\`s security is preserved even though user\`s secret information stored in the server is disclosed. By applying Chaum\`s blind signature scheme in the process of password recovery, even the PRA can\`t obtain any information about user\`s password.
Detecting anomaly packet based on neural network
Journal of the Korea Institute of Information Security and Cryptology, volume 11, issue 5, 2001, Pages 105~117
As we live in the 21st century, so called the "Information Age", network has become a basic establishment. However, we have found the different face that it also has been used as a tool of a unauthorized outflow and destruction of information. In recent years, beginner could easily get a hacking and weakness reference tools from internet. The menace of the situation has increased; the intellectual diverse offensive technique has become increasingly dangerous. The purpose of the thesis is to detect a abnormal packet for networking offense. In order to detect the packet, it gathers the packets and create inspection information that tells abnormality by using probability of special quality, then decision of intrusion is made by using a neural network.l network.