| 摘要 |
A method of sharing a key which requires less memory capacity and amount of calculation and ensures a safety equivalent to that of the conventional methods even in a network service in which the information receiver is specified. In this method, an asymmetrical matrix is used instead of a symmetrical matrix as a center algorithm used in a conventional linear scheme KPS, and both of an information transmitter ID and an information receiver ID are used as the ID, while an information transmitter secret algorithm and an information receiver secret algorithm different therefrom are used as the secret algorithms.
|
