{"title":"The IC design of a high speed RSA processor","authors":"Ching-Chao Yang, C. Jen, Tian-Sheuan Chang","doi":"10.1109/APCAS.1996.569212","DOIUrl":null,"url":null,"abstract":"In this paper, we proposed a new algorithm based on Montgomery's algorithm to calculate modular multiplication that is the core arithmetic operation in RSA cryptosystem. Since the critical path delay in modular multiplication operation is reduced, the new design yields a very fast implementation. We have implemented a 512-bit single chip RSA processor based on our modified algorithm with Compass 0.6 /spl mu/m SPDM cell library. By our modified modular exponentiation algorithm, it takes about 1.5 n/sup 2/ clock cycles to finish one n-bit RSA modular exponentiation operation in our architecture. The simulation results show that we can operate up to 125 Mhz, therefore the baud rate of our 512-bit RSA processor is about 164 k bits/sec.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCAS.1996.569212","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
In this paper, we proposed a new algorithm based on Montgomery's algorithm to calculate modular multiplication that is the core arithmetic operation in RSA cryptosystem. Since the critical path delay in modular multiplication operation is reduced, the new design yields a very fast implementation. We have implemented a 512-bit single chip RSA processor based on our modified algorithm with Compass 0.6 /spl mu/m SPDM cell library. By our modified modular exponentiation algorithm, it takes about 1.5 n/sup 2/ clock cycles to finish one n-bit RSA modular exponentiation operation in our architecture. The simulation results show that we can operate up to 125 Mhz, therefore the baud rate of our 512-bit RSA processor is about 164 k bits/sec.