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 5, Issue 1 - Mar 1995
Selecting the target year
On recursively extended Boolean functions
Chee, Seong-Taek ; Lee, Sang-Jin ; Kim, Kwang-Jo ;
Journal of the Korea Institute of Information Security and Cryptology, volume 5, issue 1, 1995, Pages 3~16
In this paper, we deal with the cryptographic properties of Boolean functions generated by recursively extended methods from the points of balancedness, nonlinearity and correlation properties. First, we propose a new concept 'Strict Uncorrelated Criterion(SUC)' for two Boolean functions as a necessary condition for constructing Boolean functions of S-box which can be guaranteed to be resistant against Differential cryptanalysis, then we show that the recurively extended Boolean functions with particular form preserve the SUC. We also examine the correlation properties of Boolean functions using Walsh-Hadamard transformations and apply them to discuss nonlinearity, correlation properties and SUC of semi-bent function which is defined over odd dimensional vector space. Finally, we compare semi-bent function with Boolean functions which are generated by other similar recursive methods.
Elliptic Curves for Efficient Repeated Additions
Lee, Eun-Jeong ; Choie, Young-Ju ;
Journal of the Korea Institute of Information Security and Cryptology, volume 5, issue 1, 1995, Pages 17~24
In spite of the good security of the cryptosystem on an elliptic curve defined over finite field, the cryptosystem on an elliptic curve is slower than that on a finite field. To be practical, we need a better method to improve a speed of the cryptosystem on an elliptic curve defined over a finite field. In 1991, Koblitz suggested to use an anomalous curve over
, which is an elliptic curve with Frobenious map whose trace is 1, and reduced a speed of computation of mP. In this paper, we consider an elliptic curve defined over
with Frobenious map whose trace is 3 and suggest an efficient algorithm to compute mP. On the proposed elliptic curve, we can compute multiples mP with
+1 addition in worst case.
A Study on the Design and Cryptanalysis of 80-bit Block Cipher Algorithm(80-DES)
Yoon, Yong-Jung ; Kong, Hun-Taek ; Nam, Kil-Hyun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 5, issue 1, 1995, Pages 25~36
Differential Cryptanalysis(DC) and Linear Cryptanalysis(LC) are considered to be efficient attack methods which could be applied to DES and other DES-like private key Cryptosystems. This paper analyzes the DC and LC attack to DES and design a 80-bit block Cipher (80-DES) which could be strong against DC and LC Attack.
Electronic Cash Schemes for EFT Using Smart Card
Youm, Heung-Youl ; Lee, Seok-Lae ; Rhee Man-Young ;
Journal of the Korea Institute of Information Security and Cryptology, volume 5, issue 1, 1995, Pages 37~50
The smart card with the cryptography and VLSI technologies makes it possible to implement the electronic cash easily. A number of electronic each schemes have been proposed by many cryptographic researchers. In this paper, we propose a practical electronic cash system, using blind digital signature scheme. Schnorr's authentication scheme based on the discrete logarithm problem, and the hierarchical cash tree based on two one-way hash functions for dividable payment. Thisf electronic cash scheme has such properties as privacy of the payment, off-line payment, non-reuseability of cash, transferability of cash to another customer, and dividable payment of cash. This electronic cash protocol is well suited for implementing in smart card.
A Secure Database Model based on Schema using Partition and Integration of Objects
Kang, Seog-Jun ; Kim, Yoeng-Won ; Hwang, Chong-Sun ;
Journal of the Korea Institute of Information Security and Cryptology, volume 5, issue 1, 1995, Pages 51~64
In distributed environments, the DB secure models have been being studied to include the multi-level mechanism which is effective to control access according to the level of the data value. These mechanisms have the problems. The first, it is impossible to maintain the global data which is protected in the multi-level mechanism. The second, the access and the relation of the data is not clear due to the access revocation between the local data and the global's. In this paper, we proposed the mechanism using shema. The mechanism doesn't have the access revocation, and provides the protection of the data and the control to the global data.
Development of Security System in the OSI Transport Layer
Park, Young-Ho ; Kim, Ki-Hyun ; Moon, Sang-Jae ; Gang, Shin-Gak ;
Journal of the Korea Institute of Information Security and Cryptology, volume 5, issue 1, 1995, Pages 65~84
The information security is needed to guarantee the safety and the confidence to users in open system. This paper analyzes transport layer security protocol and security association protocol, which are standards proposed by ISO/IEC, to provide a security service in the transport layer and particulars, not in the standard, are defined for development. And this paper suggests a development model and develps security system based upon the suggested model. The ONP of USL is used as the development environment.
Choice of Scrambling-Key by Measuring the Scrambled Signal Detection Time
Kim, Jong-Hyun ; Park, Sang-Gyu ;
Journal of the Korea Institute of Information Security and Cryptology, volume 5, issue 1, 1995, Pages 95~95
This paper presents an algorithm for scrambled domain detection and for signal detection, without knowing the scrambled domain and the descrambling-key, after a signal is scrambled in unknown domain. After measuring the time of signal detection, the method for choice of appropriate scrambling block-size (i.e.key-length) is presented. The algorithm for scrambled domain is implemented after analyzing the amplitudes of signals that are scrambled and those of signals that are scrambled and filtered using 3.6KHz highpass-filter. The algorithm for signal detection is implemented after analyzing the feature of Fourier-transformed signals and the zero-crossing rate. Finally after measuring the signal detection time of signals that are scrambled in frequency domain and time domain, the method for choice of appropriate scrambling block-size is presented.