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 6, Issue 4 - Dec 1996
Volume 6, Issue 3 - Sep 1996
Volume 6, Issue 1 - Mar 1996
Selecting the target year
CDMA Digital Mobile Communications and Message Security
Rhee, Man-Young ;
Journal of the Korea Institute of Information Security and Cryptology, volume 6, issue 4, 1996, Pages 3~38
The mobile station shall convolutionally encode the data transmitted on the reverse traffic channel and the access channel prior to interleaving. Code symbols output from the convolutional encoder are repeated before being interleaved except the 9600 bps data rate. All the symbols are then interleaved, 64-ary orthogonal modulation, direct-sequence spreading, quadrature spreading, baseband filtering and QPSK transmission. The sync, paging, and forward traffic channel except the pilot channel in the forward CDMA channel are convolutionally encoded, block interleaved, spread with Walsh function at a fixed chip rate of 1.2288 Mcps to provide orthogonal channelization among all code channels. Following the spreading operation, the I and Q impulses are applied to respective baseband filters. After that, these impulses shall be transmitted by QPSK. Authentication in the CDMA system is the process for confirming the identity of the mobile station by exchanging information between a mobile station and the base station. The authentication scheme is to generate a 18-bit hash code from the 152-bit message length appended with 24-bit or 40-bit padding. Several techniques are proposed for the authentication data computation in this paper. To protect sensitive subscriber information, it shall be required enciphering ceratin fields of selected traffic channel signaling messages. The message encryption can be accomplished in two ways, i.e., external encryption and internal encryption.
Design of Efficient Intrusion Detection System using Man-Machine
Shin, Jang-Koon ; Ra, Min-Young ; Park, Byung-Ho ; Choi, Byung-Kab ;
Journal of the Korea Institute of Information Security and Cryptology, volume 6, issue 4, 1996, Pages 39~52
Networking revolution provides users with data and resources sharing, distributed processing, and computer communication in cyberspace. However, users may use computers as a way of unauthorized access, system destruction, and leakage of the stored data. In recent trend, incresing of hacking instances which are from domestic as well as abroad reaches to the level of seriousness. It, therefore, is required to develop a secure system for the National Depense computing resources and deploy in practice in the working field as soon as possible. In this paper, we focuss on finding the security requirements of a network and designing Intrusion Detection System using statical intrusion detection and rule-based intrusion detection analysis through accumulating audit data.
Design of Secure Information Center Using a Conventional Cryptography
Choi, Jun-Hyuk ; Kim Tae-Gap ; Go, Byung-Do ; Ryou, Jae-Cheol ;
Journal of the Korea Institute of Information Security and Cryptology, volume 6, issue 4, 1996, Pages 53~66
World Wide Web is a total solution for multi-media data transmission on Internet. Because of its characteristics like ease of use, support for multi-media data and smart graphic user interface, WWW has extended to cover all kinds of applications. The Secure Information Center(SIC) is a data transmission system using conventional cryptography between client and server on WWW. It's main function is to support the encryption of sending data. For encryption of data IDEA(International Data Encryption Algorithm) is used and for authentication mechanism MD5 hash function is used. Since Secure Information Center is used by many users, conventional cryptosystem is efficient in managing their secure interactions. However, there are some restrictions on sharing of same key and data transmission between client and server, for example the risk of key exposure and the difficulty of key sharing mechanisms. To solve these problems, the Secure Information Center provides encryption mechanisms and key management policies.
Formal Description and Reference Implementation Code Generation for a Security Algorithm using VDM-SL
Kim, Young-Gil ; Kim, Ki-Su ; Kim, Young-Wha ; Ryou, Jae-Cheol ; Jang, Chung-Ryong ;
Journal of the Korea Institute of Information Security and Cryptology, volume 6, issue 4, 1996, Pages 67~84
VDL-SL (Vienna Development Method-Specification Language) is one of the FSL(Formal Specification Language) which is being presented for the correct description of the security relevant standards. Several tools are being developed for the correctness and the convenience in the description and executable code generation of security relevant standards using VDM-SL. The IFAD VDM-SL Toolbox is one that has many functions : syntax checking, type checking, c++ code generation, test coverage information. This paper describes a formal method for description and implementation of MD4 algorithm using VDM-SL and IFAD VDM-SL Toolbox, and examines the result applied to secure hash algorithm, and proposes the relation to strict conformance test which recently suggested as a security test method.
A proposal on DES-like algorithm which increases the security
Jung, Seok-Won ; Kim, Hee-Jean ; Lim, Jong-In ; Seo, Chang-Ho ;
Journal of the Korea Institute of Information Security and Cryptology, volume 6, issue 4, 1996, Pages 85~96
In this paper, a simple method to increase securities of DES against DC and LC will be proposed. Our implementation results that the proposed algorithm is as fast as DES.
Classification of Exponent Permutations over finite fields GF(
) and its applications
Park, Sang-Woo ; Kim, Kwang-Jo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 6, issue 4, 1996, Pages 97~106
In this paper, we define an equivalence relation on the group of all permutations over the finite field GF(
) and show each equivalence class has common cryptographic properties. And, we classify all exponent permutations over GF(
) and GF(
). Then, three applications of our results are described. We suggest a method for designing
S(ubstitution)-boxes by the concatenation of two exponent permutations over GF(
) and study the differential and linear resistance of them. And we can easily indicate that the conjecture of Beth in Eurocrypt '93 is wrong, and discuss the security of S-box in LOKI encryption algorithm.