用于低性能设备的加速模块化算法

L. Malina, J. Hajny
{"title":"用于低性能设备的加速模块化算法","authors":"L. Malina, J. Hajny","doi":"10.1109/TSP.2011.6043757","DOIUrl":null,"url":null,"abstract":"The paper deals with efficient modular arithmetic algorithms for resource restricted devices like smart-cards or sensors. The modular arithmetic is important for a wide variety of computations in these devices, from communication to signal processing. To speed up some cryptographic operations, the most widespread devices often have some cryptographic support provided by a dedicated chip. Our goal is to use the resources of a crypto-coprocessor to accelerate general modular operations. The paper describes our implementation of modular arithmetic operations with large integers, and provides the comparison of the accelerated method with three classical methods for (modular) multiplication. The standard methods are represented by the operand-scanning multiplication algorithm (the school-book method), the product-scanning method (Comba's method) and the Montgomery multiplication. The accelerated method is based on using the RSA encryption support for multiplication tunnelling. The performance characteristics of standard methods and the advanced method called ‘RSA tunnel’ are compared and concluded.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Accelerated modular arithmetic for low-performance devices\",\"authors\":\"L. Malina, J. Hajny\",\"doi\":\"10.1109/TSP.2011.6043757\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper deals with efficient modular arithmetic algorithms for resource restricted devices like smart-cards or sensors. The modular arithmetic is important for a wide variety of computations in these devices, from communication to signal processing. To speed up some cryptographic operations, the most widespread devices often have some cryptographic support provided by a dedicated chip. Our goal is to use the resources of a crypto-coprocessor to accelerate general modular operations. The paper describes our implementation of modular arithmetic operations with large integers, and provides the comparison of the accelerated method with three classical methods for (modular) multiplication. The standard methods are represented by the operand-scanning multiplication algorithm (the school-book method), the product-scanning method (Comba's method) and the Montgomery multiplication. The accelerated method is based on using the RSA encryption support for multiplication tunnelling. The performance characteristics of standard methods and the advanced method called ‘RSA tunnel’ are compared and concluded.\",\"PeriodicalId\":341695,\"journal\":{\"name\":\"2011 34th International Conference on Telecommunications and Signal Processing (TSP)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 34th International Conference on Telecommunications and Signal Processing (TSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TSP.2011.6043757\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSP.2011.6043757","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

本文研究了智能卡或传感器等资源受限设备的高效模块化算法。模块化算法对于这些设备中从通信到信号处理的各种计算都很重要。为了加速某些加密操作,最广泛的设备通常具有由专用芯片提供的一些加密支持。我们的目标是利用加密协处理器的资源来加速一般的模块化操作。本文描述了大整数模运算的实现,并将加速法与三种经典的(模)乘法方法进行了比较。标准方法由操作数扫描乘法算法(教科书方法)、乘积扫描方法(Comba方法)和Montgomery乘法表示。加速方法基于RSA加密对乘法隧道的支持。比较和总结了标准方法和先进的“RSA隧道”方法的性能特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Accelerated modular arithmetic for low-performance devices
The paper deals with efficient modular arithmetic algorithms for resource restricted devices like smart-cards or sensors. The modular arithmetic is important for a wide variety of computations in these devices, from communication to signal processing. To speed up some cryptographic operations, the most widespread devices often have some cryptographic support provided by a dedicated chip. Our goal is to use the resources of a crypto-coprocessor to accelerate general modular operations. The paper describes our implementation of modular arithmetic operations with large integers, and provides the comparison of the accelerated method with three classical methods for (modular) multiplication. The standard methods are represented by the operand-scanning multiplication algorithm (the school-book method), the product-scanning method (Comba's method) and the Montgomery multiplication. The accelerated method is based on using the RSA encryption support for multiplication tunnelling. The performance characteristics of standard methods and the advanced method called ‘RSA tunnel’ are compared and concluded.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信