| 摘要 |
PROBLEM TO BE SOLVED: To maintain safety strength and to make memory capacity and a calculation amount which are requested by an information receiver side small by sharing a key only between entities that belong to different groups. SOLUTION: Let's assume two kinds of entities that are an information originator P (provider) and an information receiver C (consumer) who share a key that is used for cipher communication, etc., on a network and a center that performs key management. The center generates a center algorithm Gi ,αthat is known only to the center and generates secret algorithms Xcαand Ypi which are peculiar to the entities from the center algorithm and IDs of the entities. The generated secret algorithms Xcαand Ypi are distributed to respective entities in a method that guarantees safety. The entities which acquire the algorithms Xcαand Ypi can easily realize key sharing by inputting the ID of the other communication party into the algorithms Xcαand Ypi .
|
