{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T20:45:17Z","timestamp":1698007517009},"reference-count":11,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":7749,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1986,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The RSA scheme is considered as one of the most promising as a digital signature, i.e., the signature for document for digital information. However, the method has a problem in that the processing speed is slow. A method by high\u2010speed hash function is proposed as a solution to this problem, but the improvement is not remarkable for brief documents. To solve this problem, this paper proposes a new high\u2010speed digital signature scheme based on a congruent polynomial of lower degree. In this scheme, large prime numbers <jats:italic>p<\/jats:italic> and <jats:italic>q<\/jats:italic> are used as the secret information and <jats:italic>n<\/jats:italic> = <jats:italic>p<\/jats:italic><jats:sup>2<\/jats:sup><jats:italic>q<\/jats:italic> is used as the public information. A random number is used in the generation of the signature, and an equality is used in the verification. It is shown that the security of the proposed scheme is of the same order as the difficulty of the prime factorization of <jats:italic>n.<\/jats:italic> The processing speed and transfer\/retained information of the proposed scheme are evaluated, indicating that the processing speed for a brief document is more than 100 times the RSA scheme, and the method requires larger secret information to be retained than in RSA scheme.<\/jats:p>","DOI":"10.1002\/scj.4690170505","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T12:04:30Z","timestamp":1183809870000},"page":"36-44","source":"Crossref","is-referenced-by-count":1,"title":["A digital signature scheme based on polynomial operations"],"prefix":"10.1002","volume":"17","author":[{"given":"Tatsuaki","family":"Okamoto","sequence":"first","affiliation":[]},{"given":"Akira","family":"Shiraishi","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"87","article-title":"Digital Signature \u2010 An Overview","volume":"3","author":"Matyas S. M.","year":"1979","journal-title":"Computer Networks"},{"key":"e_1_2_1_3_2","first-page":"2","article-title":"A Method for Obtaining Digital Signatures and Public Key Cryptosystem","volume":"21","author":"Rivest R. V.","year":"1974","journal-title":"Comm. ACM"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TIT.1978.1055927","article-title":"Hiding Information and Signatures in Trapdoor Knapsacks","volume":"24","author":"Merkle R. C.","year":"1978","journal-title":"I.E.E.E. Trans. Inf. Theory"},{"key":"e_1_2_1_5_2","unstructured":"A.Shamir. A Fast Signature Scheme MIT\/LCS\/TM\u2010107 (July 1978)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"A.Shamir. A Polynomial Time Algorithm for Breaking the Basic Mercle\u2010Hellman Cryoptosystem Proc. 23rd Ann. Symp. Found. Comp. Sci. pp.145\u2013152(Nov. 1982).","DOI":"10.1109\/SFCS.1982.5"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"D. W.Davies. Applying the RSA Digital Signature to Electronic Mail I.E.E.E. Computer pp.55\u201362(Feb. 1983).","DOI":"10.1109\/MC.1983.1654301"},{"key":"e_1_2_1_8_2","first-page":"3","article-title":"Fast and secure digital signature using public key cryptosystems","volume":"67","author":"Koyama K.","year":"1984","journal-title":"Trans. (D), I.E.C.E., Japan"},{"key":"e_1_2_1_9_2","first-page":"89","volume-title":"Number Theory and Computers","author":"Pomerance C.","year":"1982"},{"key":"e_1_2_1_10_2","unstructured":"M. O.Rabin. Digitalized Signatures and Public\u2010key Functions as Intractable as Factorization MIT\/LCS\/TR\u2010212 (Sept. 1979)."},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"G. I.DavidaandD. L.Wells. Microprocessors and Data Encryption Proc. COMPCON pp.154\u2013159(Sept. 1979).","DOI":"10.1109\/CMPCON.1979.729100"},{"key":"e_1_2_1_12_2","volume-title":"Statistic","author":"Tajima I.","year":"1964"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690170505","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690170505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T02:25:49Z","timestamp":1697855149000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690170505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["10.1002\/scj.4690170505"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690170505","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}