TIMING ATTACK AGAINST BLAKLEY'S MODULAR MULTIPLICATION ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

BAKHSHI B.; SADEGHIAN BABAK

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING Year:2006 | Volume:4 | Issue:3 (A) Page(s): 27-36

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

887

Download:

Cites:

Information Journal Paper

Title

TIMING ATTACK AGAINST BLAKLEY'S MODULAR MULTIPLICATION ALGORITHM

Author(s)

BAKHSHI B. | SADEGHIAN BABAK | Issue Writer Certificate

Keywords

TIMING ATTACKQ4

MODULAR MULTIPLICATIONQ4

BLAKLEY'S ALGORITHMQ4

CORRELATIONQ2

Abstract

The published TIMING ATTACK schemes against modular exponentiation implementations are based on the large variations in their time measurements, while it is assumed that the running time of each step of the algorithm is independent of the running time of other steps. In this paper, we propose a new TIMING ATTACK scheme against Blakley's MODULAR MULTIPLICATION, which has rather small timing variations with respect to modular exponentiation. We show that the assumption of independency of the running time of different steps is not valid for BLAKLEY'S ALGORITHM. We mathematically model the CORRELATIONs between the running times of different steps. It is assumed that a set of known inputs multiplied by the same constant and the running time of each multiplication are given, but the multiplication result is not known. In addition, a machine similar to victim machine is not available. In some applications, such as Digital Signature Standard, the constant is the secret key. We take advantage of the obtained CORRELATION to present our TIMING ATTACK scheme for obtaining the constant parameter, which is the secret key. In addition to the attack scheme, an error detection scheme is presented. We also propose an error correction method in order to improve our attack efficiency. Practical implementation of our attack against DSS shows that error probability is less than 0.15, and the 160-bit secret key is found using 1,500,000 timing measurements.

Cites

No record.

References

No record.

Cite

APA: Copy

BAKHSHI, B., & SADEGHIAN, BABAK. (2006). TIMING ATTACK AGAINST BLAKLEY'S MODULAR MULTIPLICATION ALGORITHM. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, 4(3 (A)), 27-36. SID. https://sid.ir/paper/70664/en

Vancouver: Copy

BAKHSHI B., SADEGHIAN BABAK. TIMING ATTACK AGAINST BLAKLEY'S MODULAR MULTIPLICATION ALGORITHM. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING[Internet]. 2006;4(3 (A)):27-36. Available from: https://sid.ir/paper/70664/en

IEEE: Copy

B. BAKHSHI, and BABAK SADEGHIAN, “TIMING ATTACK AGAINST BLAKLEY'S MODULAR MULTIPLICATION ALGORITHM,” THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, vol. 4, no. 3 (A), pp. 27–36, 2006, [Online]. Available: https://sid.ir/paper/70664/en

Related Journal Papers