An Efficient Key-Lock-Pair Mechanism Based on Division Algorithm

In the access control of a file system, the Chinese remainder theorem (CRT) is a method used to establish the key-lock-pair mechanism, However, the key computed using CRT takes much more time to add up a new file. In order to improve upon this, we show that the key-lock- pair mechanism based on the division algorithm can be extended very efficiently when a file is added to the file system. Also, it can be applied to delete a file or to update the access rights of a file in the file system. Therefore, the proposed method is very useful for the dynamic file system.