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 10, Issue 4 - Dec 2000
Volume 10, Issue 3 - Sep 2000
Volume 10, Issue 2 - Jun 2000
Volume 10, Issue 1 - Mar 2000
Selecting the target year
Bit-sliced Modular Multiplication Algorithm and Implementation
Journal of the Korea Institute of Information Security and Cryptology, volume 10, issue 3, 2000, Pages 3~10
In this paper we propose a bit-sliced modular multiplication algorithm and a bit-sliced modular multiplier design meeting the increasing crypto-key size for RSA public key cryptosystem. The proposed bit-sliced modular multiplication algorithm was designed by modifying the Montgomery's algorithm. The bit-sliced modular multiplier is easy to expand to process large size operands and can be immediately applied to RSA public key cryptosystem.
Role-Behavior Based Access Control on Mobile Agent System for Workflow Management System
Journal of the Korea Institute of Information Security and Cryptology, volume 10, issue 3, 2000, Pages 11~28
In these days it is rapidly increasing that multi-user, multi-layered commercial software developments for companies or public institutions. Security services are necessary for most of systems and the access control service is the essential of security services. Current access control methods that are used as access control policies are classified as Discretionary Access Control Mandatory Access Control and Role Based Access Control. However there are some inefficiencies when those methods are applied to current multi-user, multi-layered systems. Therefore it is required that a new access control method that takes complex system resources into account from the side of policy. In this paper extending previous Role Based of 'Behavior' and a basic model of the method. And we simply implement the method on the mobile agent based workflow management system that is a representative example of multi-user. multi-layered softwares and shows implementation results to tap possibilities of real-world application.
Random sequence synchronization failure detection algorithm for synchronous stream cipher system using RMVD
Journal of the Korea Institute of Information Security and Cryptology, volume 10, issue 3, 2000, Pages 29~36
It is very import role to increase communication quality that fast detection of random sequence synchronization fail in synchronous stream cipher system using initial synchronization mode. Generally it sends additional information to detect random sequency synchronization fail. But we can't transmit additional informations to decide synchronization fail in a system using RMVD to correct channel error. In this paper we propose a method to detect synchronization fail in the receiver even though a system using RMVD has no margin to send additional information, For detecting random sequency synchronization fail we decipher receiver data analyze probability of transition rate for pre-determined period and decide synchronization fail using calculated transition rate probability. This proposed method is fast very reliable and robust in noisy channel and is easily implemented with hardware.
New Construction of (2,n) Visual Cryptography for Multiple Secret Sharing
Journal of the Korea Institute of Information Security and Cryptology, volume 10, issue 3, 2000, Pages 37~48
서울Visual cryptography scheme is a simple method in which can be directly decoded the secret information in human visual system without performing any cryptographic computations. This scheme is a kind of secret sharing scheme in which if a secret of image type is scattered to n random images(slides) and any threshold (or more) of them are stacked together the original image will become visible. In this paper we consider (2, n) visual cryptography scheme and propose a new construction method in which the number of expanded pixels can be reduced by using the sample matrix. The proposed scheme can futhermore distribute the multiple secret image to each group according to the difference of relative contrast.
User-Level Delegation in Role-Based Access Control Model
Journal of the Korea Institute of Information Security and Cryptology, volume 10, issue 3, 2000, Pages 49~62
Role-Based Access Control(RBAC) has recently received considerable attention as a alternative to traditional discretionary and mandatory access control to apply variant organizations function hierarchy of commercial or govemment. Also RBAC provides a delegation that is one of control principles in organization. In general delegation occurring in real organization is performed by an user giving permissions to another user. But, RBAC cannot implement these user-level delegation correctly. And delegation result in security problem such as destroying separation of duty policy information disclosure due to inappro-priate delegation. Besides security adminsitrator directly deals with that problem. In this thesis we suggests some methods that is created by the user.
An Efficient Signcryption Scheme for Multi-Sending
Journal of the Korea Institute of Information Security and Cryptology, volume 10, issue 3, 2000, Pages 63~68
Y. Zheng suggested a new concept called signcryption that provides confidentiality with digital signature properties. The signcryption scheme is more efficient than general method what we call first-sign-then-encrypt of first-encrypt-then-sign in computational and communicational cost. But H. Petersen et al pointed out weakness to Y. Zheng' scheme and suggested new one. In this paper we survey three signcryption schemes suggested by Y, Zheng and H. Petersen et al respectively and cryptanalysis. M. Michel's revised scheme. And we suggest a new signcryption is more efficient when originator makes several signcryption on the same document.
Secret Group Key Re-sharing Method Suitable for Digital Mobile Communication
Journal of the Korea Institute of Information Security and Cryptology, volume 10, issue 3, 2000, Pages 69~76
In this paper we propose a new group key renewal scheme suitable for secure mobile communications in which all members of the group can re-share the new group common key excepted a revoked member using a key distribution center(a trusted center). A renewal group key in the proposed scheme can be shared many times using pre-distributed data by a smart card without a preparation stage. This scheme is also avaliable for a large group network because the transmitted data amount after identifying the revoked member does not depend on a size of group. The secuirty of this scheme is based on the difficulty of the discrete logarithm
The Montgomery Multiplier Using Scalable Carry Save Adder
Journal of the Korea Institute of Information Security and Cryptology, volume 10, issue 3, 2000, Pages 77~83
This paper presents a new modular multiplier for Montgomery multiplication using iterative small carry save adder. The proposed multiplier is more flexible and suitable for long bit multiplication due to its scalable property according to design area and required computing time. We describe the word-based Montgomery algorithm and design architecture of the multiplier. Our analysis and simulation show that the proposed multiplier provides area/time tradeoffs in limited design area such as IC cards.