Library Automation and Digital Archive
LONTAR
Fakultas Ilmu Komputer
Universitas Indonesia

Pencarian Sederhana

Find Similar Add to Favorite

Call Number 005.82 Cry
Collection Type Indeks Artikel LNCS
Title More detail for combined timing and power attack againt implementation of RSA, Efficient key updating signaturn schemes based on IBS, LNCS-Lecture Notes in Computer Science 2898) Hal. 245-263
Author Werner Schinler and Colin D. Walter;
Publisher Springer, 2003
Subject
Location
Lokasi : Perpustakaan Fakultas Ilmu Komputer
Nomor Panggil ID Koleksi Status
005.82 Cry TERSEDIA
Tidak ada review pada koleksi ini: 42168
Implementations of montgomery's modular multiplication algorithm (MMM) typically mke conditional subtractions in order to keep the output within register of modulus bounds. For some standard exponentation algorithms such as m-ary, it has been shown that this yields enough information to deduce the value of the exponent. This has serious implications for revealing the secret key in cryptographc applications without adequate counter-measures. Much moder detail is provided here about the distribution of output values from MMM when the output is only reduced to keep it within register bounds, about how implementations of sliding windows can be attacted, and about handling errors