{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:54:39Z","timestamp":1649073279902},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1007\/bf00991623","type":"journal-article","created":{"date-parts":[[2005,1,14]],"date-time":"2005-01-14T17:53:03Z","timestamp":1105725183000},"page":"285-316","source":"Crossref","is-referenced-by-count":1,"title":["Computationally efficient algorithms for a one-time pad scheme"],"prefix":"10.1007","volume":"12","author":[{"given":"A. G.","family":"Akritas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. S.","family":"Iyengar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Rampuria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01395988","volume":"36","author":"A. G. Akritas","year":"1980","unstructured":"A. G. Akritas, An implementation of Vincent's theorem,Numerishche Mathematik 36:53?62 (1980).","journal-title":"Numerishche Mathematik"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF02237816","volume":"24","author":"A. G. Akritas","year":"1980","unstructured":"A. G. Akritas, The fastest exact algorithms for the isolation of the real roots of a polynomial equation,Computing 24:299?313 (1980).","journal-title":"Computing"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/00207168108803254","volume":"9","author":"A. G. Akritas","year":"1981","unstructured":"A. G. Akritas, Exact algorithm for the implementation of Cauchy's rule,Int. J. Comp. Math. 9:323?333 (1981).","journal-title":"Int. J. Comp. Math."},{"issue":"4","key":"CR4","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1080\/0161-118291857136","volume":"6","author":"A. G. Akritas","year":"1982","unstructured":"A. G. Akritas, Application of Vincent's theorem in cryptography or one-time pads made practical,Cryptologia 6(4):312?318 (1982).","journal-title":"Cryptologia"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02242791","volume":"24","author":"A. G. Akritas","year":"1980","unstructured":"A. G. Akritas and S. D. Danielopoulos, On the complexity of algorithms for the translation of polynomials,Computing 24:51?60 (1980).","journal-title":"Computing"},{"issue":"3\/4","key":"CR6","first-page":"41","volume":"2","author":"A. G. Akritas","year":"1980","unstructured":"A. G. Akritas and S. D. Danielopoulos, An unknown theorem for the isolation of the roots of polynomials,Ganita Bharati 2(3\/4):41?49 (1980).","journal-title":"Ganita Bharati"},{"issue":"2","key":"CR7","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1147\/sj.172.0106","volume":"17","author":"W. F. Ehrsam","year":"1978","unstructured":"W. F. Ehrsam, S. M. Matyas, C. H. Meyer, and W. L. Tuchman, A cryptographic key management scheme for implementing the data encryption standard,IBM Syst. J. 17(2):106?125 (1978).","journal-title":"IBM Syst. J."},{"key":"CR8","unstructured":"W. Diffie and M. E. Hellman, A critique of the proposed date encryption standard,Comm. ACM (March 1976), pp. 164?165."},{"issue":"5","key":"CR9","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1109\/TSE.1980.230489","volume":"SE-6","author":"E. Gudes","year":"1980","unstructured":"E. Gudes, The design of a cryptography based secure file system,IEEE Trans. Software Eng. SE-6(5):411?420 (September 1980).","journal-title":"IEEE Trans. Software Eng."},{"key":"CR10","unstructured":"E. Gudes, F. A. Stahl, and H. E. Koth, Applications of cryptographic transformations to data base security, inProceedings of National Computer Conference (1976)."},{"key":"CR11","volume-title":"The C Programming Language","author":"B. W. Kernighan","year":"1978","unstructured":"B. W. Kernighan and D. M. Ritchie,The C Programming Language, Prentice-Hall, Englewood Cliffs, New Jersey (1978)."},{"key":"CR12","first-page":"1","volume-title":"The Art of Computer Programming","author":"D. E. Knuth","year":"1969","unstructured":"D. E. Knuth,The Art of Computer Programming, Addison Wesley, Reading, Mass., Vol. 2, pp. 1?70 (1969)."},{"key":"CR13","first-page":"122","volume":"255","author":"S. Lang","year":"1972","unstructured":"S. Lang and H. Trotter, Continued franctions for some algebraic numbers,J. Reine Angew. Math. 255:122?134 (1972).","journal-title":"J. Reine Angew. Math."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"R. C. Merkle, Secure communications over insecure channels,Comm. ACM 1978:194?299.","DOI":"10.1145\/359460.359473"},{"key":"CR15","volume-title":"Polynomial real root approximation using continued fractions, M.S. Research Report","author":"K. H. Ng","year":"1980","unstructured":"K. H. Ng, Polynomial real root approximation using continued fractions, M.S. Research Report, Department of Computer Science, University of Kansas, Lawrence, Kansas (1980)."},{"key":"CR16","first-page":"187","volume-title":"Numerical Computing and Mathematical Analysis","author":"S. M. Pizer","year":"1975","unstructured":"S. M. Pizer,Numerical Computing and Mathematical Analysis, Science Research Associates, Chicago, pp. 187?217 (1975)."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"G. B. Purdy, A high security log-in procedure,CACM 17 (August 1974).","DOI":"10.1145\/361082.361089"},{"key":"CR18","volume-title":"A secure method for cryptography, M.S. Research Report","author":"A. Rampuria","year":"1982","unstructured":"A. Rampuria, A secure method for cryptography, M.S. Research Report, Department of Computer Science, University of Kansas, Lawrence, Kansas (1982)."},{"key":"CR19","volume-title":"Theory of Equations","author":"J. V. Uspensky","year":"1948","unstructured":"J. V. Uspensky,Theory of Equations, McGraw-Hill, New York (1948)."},{"key":"CR20","unstructured":"A. J. H. Vincent, Sur la r\u00e9sultion des \u00e9quation numeriques,J. Math. Pures Appl. 1:341?372 (1836)."}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00991623.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00991623\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00991623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:54:44Z","timestamp":1556585684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00991623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["BF00991623"],"URL":"https:\/\/doi.org\/10.1007\/bf00991623","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}