Gurushala

Tighter, faster, simpler side-channel security evaluations beyond computing power

A Eurocrypt 2013 paper “Security evaluations beyond com-puting power: How to analyze side-channel attacks you cannot mount?”
by Veyrat-Charvillon, G´erard, and Standaert proposed a “Rank Esti-mation Algorithm” (REA) to estimate the difficulty of finding a secret
key given side-channel information from independent subkeys, such as
the 16 key bytes in AES-128 or the 32 key bytes in AES-256. The lower
and upper bounds produced by the algorithm are far apart for most key
ranks. The algorithm can produce tighter bounds but then becomes ex-ponentially slower; it also becomes exponentially slower as the number
of subkeys increases.

Comments

Syed Samdani

3 mon ago

Super explained about REA🌹💐👌👏👏 Syed Samdani Telangana

Nisha Khandalkar

2 year ago

Good

Satya Pal Singh

2 year ago

Well explained !

Tighter, faster, simpler side-channel security evaluations beyond computing power

Ed-Tech

Tighter, faster, simpler side-channel security evaluations beyond computing power

Comments