| C. Karlof and D. Wagner. Hidden Markov Model Cryptanalysis. In Cryptographic Hardware and Embedded Systems (CHES), Springer-Verlag LNCS 2779, 17--34, 2003. |
....Those are the attacks where a single measurement of power consumption can reveal significant information such as distinguished point doubling and adding operations, but more than one such measurement may be needed to infer the key value or reduce the key search space. Karlof and Wagner [15] proposed a general cryptanalysis model for randomized algorithms that could totally recover a 192 bit key with as few as ten traces when it was applied to Oswald and Aigner s both countermeasures. Also it can take into account measurement errors from a noisy side channel and in that case it can ....
C. Karlof and D. Wagner. Hidden Markov model cryptanalysis. In Cryptographic Hardware and Embedded Systems -- CHES '03, Sept. 2003. to appear.
No context found.
Karlof, C., Wagner, D.: Hidden Markov Model Cryptanalysis. Technical Report UCB//CSD03 -1244, University of California at Berkeley (2003)
No context found.
C. Karlof and D. Wagner. Hidden Markov Model Cryptanalysis. In Cryptographic Hardware and Embedded Systems (CHES), Springer-Verlag LNCS 2779, 17--34, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC