发明名称 MODULAR EXPONENTIATION OPTIMIZATION FOR CRYPTOGRAPHIC SYSTEMS
摘要 A processing device, such as logic on an integrated circuit may identify a cryptographic message stored in a first register. The processing device may determine a plurality of components for a second power of the cryptographic message using a plurality of components of the cryptographic message. The processing device may determine the plurality of components for the second power of the cryptographic message without storing the entire second power of the cryptographic message. Further, the processing device may determine a third power of the cryptographic message using modular arithmetic. The processing device may determine the third power by transforming the plurality of components for the second power of the cryptographic message and the plurality of components of the cryptographic message.
申请公布号 US2015180652(A1) 申请公布日期 2015.06.25
申请号 US201414567954 申请日期 2014.12.11
申请人 CRYPTOGRAPHY RESEARCH, INC. 发明人 Kocher Paul C.;Hamburg Michael A.;Kumar Ambuj
分类号 H04L9/06;H04L9/14 主分类号 H04L9/06
代理机构 代理人
主权项 1. A method comprising: identifying, by logic on an integrated circuit, a cryptographic message stored in a first register; determining a plurality of components for a second power of the cryptographic message using a plurality of components of the cryptographic message, wherein the determining of the plurality of components for the second power of the cryptographic message is performed without storing the entire second power of the cryptographic message; and determining a third power of the cryptographic message using modular arithmetic, wherein said determining comprises transforming the plurality of components for the second power of the cryptographic message and the plurality of components of the cryptographic message, and wherein the plurality of components for the second power of the cryptographic message are determined without using modular arithmetic.
地址 San Francisco CA US