{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T18:51:21Z","timestamp":1672253481370},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1007\/bf01954895","type":"journal-article","created":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T00:33:57Z","timestamp":1122856437000},"page":"755-763","source":"Crossref","is-referenced-by-count":4,"title":["A generalisation of Brickell's algorithm for fast modular multiplication"],"prefix":"10.1007","volume":"28","author":[{"given":"J. K.","family":"Gibson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01954895_CR1","unstructured":"P. Barrett,Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In Lecture Notes in Computer Science 263, Conf. Proceedings, Crypto 86. Springer, 1987."},{"issue":"5","key":"BF01954895_CR2","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/TC.1983.1676262","volume":"C 32","author":"G. R. Blakeley","year":"1983","unstructured":"G. R. Blakeley,A computer algorithm for calculating the product AB modulo M. IEEE Trans. on Computers, Vol. C 32, no. 5, pp. 497\u2013500, May 1983.","journal-title":"IEEE Trans. on Computers"},{"key":"BF01954895_CR3","doi-asserted-by":"crossref","unstructured":"E. F. Brickell,A fast modular multiplication algorithm with applications to two key cryptography. In Advances in Cryptology, Conf. Proceedings, Crypto 82. Plenum Press, 1982.","DOI":"10.1007\/978-1-4757-0602-4_5"},{"key":"BF01954895_CR4","doi-asserted-by":"crossref","unstructured":"F. E. Fich and M. Tompa,The parallel complexity of exponentiating polynomials over finite fields. 17th ACM Symp. on the Theory of Computing, 1985.","DOI":"10.1145\/22145.22150"},{"issue":"1","key":"BF01954895_CR5","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/4.280","volume":"23","author":"Harn","year":"1988","unstructured":"Harn, Hwang, Lee, and Lu,A programmable VLSI architecture for computing multiplication and polynomial evaluation modulo a positive integer. IEEE J. of Solid-state Circuits, Vol. 23, No. 1, pp. 204\u2013207, Feb. 1988.","journal-title":"IEEE J. of Solid-state Circuits"},{"key":"BF01954895_CR6","unstructured":"M. Kochanski,Developing an RSA chip. In Lecture Notes in Computer Science 218, Conf. Proceedings, Crypto 85. Springer, 1985."},{"key":"BF01954895_CR7","unstructured":"C. Mitchell and A. Selby,Algorithms for software implementations of RSA. Memo No. HPL-BRC-TM-87-043, Hewlett Packard Laboratories, Filton Road, Stoke Gifford, Bristol BS12 6QZ, England, 1988."},{"key":"BF01954895_CR8","unstructured":"M. J. Norris and G. J. Simmons,Algorithms for high-speed modular arithmetic. Congressus Numerantium, Vol. 31, 1981."},{"key":"BF01954895_CR9","unstructured":"G. A. Orton, M. P. Roy, P. A. Scott, L. E. Peppard, and S. E. Tavares,VLSI implementation of public-key encryption algorithms. In Lecture Notes in Computer Science 263. Conf., Proceedings, Crypto 86. Springer, 1987."},{"key":"BF01954895_CR10","unstructured":"P. Riess and J. Shawe-Taylor,The RSA public key cryptosystem. Dept. of Statistics and Computer Science notes, RHNBC, Egham Hill, Egham. Surrey, England TW20 0EX, 1986."},{"key":"BF01954895_CR11","doi-asserted-by":"crossref","unstructured":"R. Rivest, A. Shamir, and L. Adleman,A method for obtaining digital signatures and public key cryptosystems. Comm. ACM, vol. 21, 1978.","DOI":"10.21236\/ADA606588"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01954895.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01954895\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01954895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T14:04:28Z","timestamp":1586354668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01954895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["BF01954895"],"URL":"https:\/\/doi.org\/10.1007\/bf01954895","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}