{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T04:59:50Z","timestamp":1698037190183},"reference-count":12,"publisher":"Wiley","issue":"9","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":5923,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1991,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper describes the key predistribution system (KPS) which simplifies the use of public key cryptography in a large\u2010scale complex network. The identity (ID) transformer <jats:italic>R<\/jats:italic>, which is needed in the realization of KPS by a linear scheme, is proposed and evaluated; <jats:italic>R<\/jats:italic> is an algorithm which transforms a short vector into a long vector. It is desired that <jats:italic>R<\/jats:italic> be executed in a simple way by an IC card and can realize a one\u2010way and random injective function; a method to realize such <jats:italic>R<\/jats:italic> is discussed fully in this paper. An example <jats:italic>R<\/jats:italic><jats:sub>1<\/jats:sub> with the specified parameters is realized using 8 bit CPU, and it is verified that the ID transformer algorithm can be executed in approximately 0.4 s, using the one\u2010way algorithm with the processing speed of approximately 50 kbit\/s. As a result of evaluation of the statistical randomness, it is verified that the random condition is satisfied.<\/jats:p>","DOI":"10.1002\/scj.4690220901","type":"journal-article","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T12:19:59Z","timestamp":1195042799000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Construction and evaluation of the identity transformers for cryptographic key distribution"],"prefix":"10.1002","volume":"22","author":[{"given":"Tsutomu","family":"Matsumoto","sequence":"first","affiliation":[]},{"given":"Youichi","family":"Takashima","sequence":"additional","affiliation":[]},{"given":"Hideki","family":"Iraai","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"39","article-title":"Third key sharing system","volume":"86","author":"Matsumoto T.","year":"1986","journal-title":"Proc. Workshop, Cryptography and Inf. Security"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"T.MatsumotoandH.Imai.On the Key\u2010Predistribution System: A practical solution to the key distribution problem. Advances in Cryptology: Proceedings of CRYPTO '87. Springer Lecture Notes in Computer Science 293 pp.185\u2013193(1987).","DOI":"10.1007\/3-540-48184-2_14"},{"key":"e_1_2_1_4_2","unstructured":"T.MatsumotoandH.Imai.Applying the key predistribution system to electronic mails and signatures. Proceedings of SITA '87 pp.101\u2013106(Nov.1987)."},{"key":"e_1_2_1_5_2","article-title":"Performance of linear schemes for the key predistribution system","volume":"88","author":"Matsumoto T.","year":"1988","journal-title":"I.E.I.C.E. Technical Report"},{"issue":"11","key":"e_1_2_1_6_2","first-page":"2046","article-title":"Sharing of cipher key without communication","volume":"71","author":"Matsumoto T.","year":"1988","journal-title":"Trans. (A), I.E.I.C.E., Japan"},{"key":"e_1_2_1_7_2","article-title":"Construction of ID transformer useful in sharing cipher key","volume":"88","author":"Matsumoto T.","year":"1988","journal-title":"Tech. Rep., I.E.I.C.E., Japan"},{"key":"e_1_2_1_8_2","article-title":"A one\u2010way injective algorithm with efficient length expansion","volume":"2","author":"Matsumoto T.","year":"1989","journal-title":"Proc. 1989 Symp. Crypt, and Inf. Secur."},{"key":"e_1_2_1_9_2","article-title":"Experimental evaluation of oneway injective algorithm with length expansion","volume":"88","author":"Matsumoto T.","year":"1989","journal-title":"Tech. Rep., I.E.I.C.E., Japan"},{"issue":"4","key":"e_1_2_1_10_2","first-page":"321","article-title":"FEAL (fast data encryption algorithm)\u20108","volume":"37","author":"Miyairi S.","year":"1988","journal-title":"Tech. Rep. Elect. Comm. Lab."},{"key":"e_1_2_1_11_2","unstructured":"K.Takaragi R.Sasaki andS.Nakagawa.A high\u2010speed cryptography for multimedia. Tech. Rep. Multimedia Comm. and Distr. Proc. Inf. Proc. Soc. Jap. No. 40\u20135 (Jan.1989)."},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"R. L.Rivest A.Shamir andL.Adleman.A method of obtaining digital signatures and public key cryptosystems. Comm. of ACM pp.120\u2013126(Feb.1978).","DOI":"10.1145\/359340.359342"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690220901","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690220901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T02:37:58Z","timestamp":1698028678000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690220901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":12,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["10.1002\/scj.4690220901"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690220901","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}