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 2, Issue 1 - Jun 1992
Volume 2, Issue 2 - 00 1992
Selecting the target year
A Secure Object-Relationship Model for Multilevel Database Design
Sim Gab-Sig ; Noh, Bong-Nam ;
Journal of the Korea Institute of Information Security and Cryptology, volume 2, issue 2, 1992, Pages 3~3
The security property which is important in real world data processing has not been much considered in most conceptual data modeling techniques. This paper proposes the Secure Objet-RElationship Model(SOREM) which represents data integrity and security effectively. We present the simple graphical diagrams and fundamental security properties of SOREM. We also present rules that transform the schema of SOREM into a secure relational schema. SOREM can model not only static properties such as object class, attribute and relationship, but also dynamic properties guaranteeing data integrity and security in the conceptual database design step. The SOREM is useful in preventing the inconsistency of data between the schema definitions and the implementation of operations on those data.
A Study on Design of the Improved Bit-Serial Multipler
Tai, Young-Soo ; Rhee, Man-Young ;
Journal of the Korea Institute of Information Security and Cryptology, volume 2, issue 2, 1992, Pages 21~21
We propose an improved dual basis multiplier based on Berlekamp's bit-serial multiplication algorithm. For implementation of this scheme, the conception of trace and dual basis will be introduced in detail. The proposed multiplier is designed over the finite field GF(
). This multiplier offers advantages for implementation using the same dual basis representation for two imput elements. Also, for the decoding of a Reed-Solomon code which is matched to bit-serial Reed-Solomon encoder, the conventional RS syndrome generators will be converted into the bit-serial manner. The improved bit-serial multiplier discussed here can also be applied to design of the CODEC of Reed-Solomon codes. It is expected from our results that the RS encoder and decoder using the proposed multiplication algorithm requires substantially less hardware than any other kind of CODEC design.
A Survey On Cryttograthic Assumptions
Shin Hyun-Yong ;
Journal of the Korea Institute of Information Security and Cryptology, volume 2, issue 2, 1992, Pages 28~28
The security of many cryptosystems are based on several cryptographic assumptions. In this paper, we survey on some cryptographic assumptions which are widely used and their relationship. We explain the bit commitment scheme and oblivious transfer somewhat in detail.
Factoring polynomials over integers and algebraic number fields
Cho, In-Ho ; Lim, Jong-In ; Kim, Chang-Han ;
Journal of the Korea Institute of Information Security and Cryptology, volume 2, issue 2, 1992, Pages 34~34
A Research on the Security Systems in the Next Generation Advanced Information Communications Networks Environment -A design and Implementation of the Generic Key Management Model in the OSI Application Layer-
Na, Jong-Keun ; Kim, Dong-Kyoo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 2, issue 2, 1992, Pages 40~40
In order to provide efficient security services in the next generation advanced network environment including existing OSI networks, application independent kdy management schemes must be supported. For this purpose, a generic key management model for use in OSI application services has been designed where key-related information which individual application services need is distributed and managed based on automated means. Certificate-based key management service which is n important functionality in the model has been implemented on the ISODE-7.0 protocol stack, modularized into three parts : public key, PKF(Public Key File), and SMIB(Security Management Information Base) management module.
3 Move ZKIP for language and Its Applications
Yang, Hyung-Kyu ; Won, Dong-Ho ;
Journal of the Korea Institute of Information Security and Cryptology, volume 2, issue 2, 1992, Pages 52~52
In this paper we propose the more efficient 3 move oracle simulation ZKIP than the scheme that okamoto proposed using the Hamilton circuit problem. The scheme that Okamoto proposed is that the number of bits to be trapdoor committed is 0(
) but our scheme is that the number of bits to be trapdoor committed is 9(n) because of using the trapdoor coin flipping protocol to generated the verifier's challenge bits. Then, the number of bits communicated in our ZKIP is only 1/
of that of Okamoto. And we propose the efficient message authentication scheme secure against chosen ciphertext attacks, using the proposed scheme.