Weierstraß Elliptic Curves and Side-Channel Attacks
By Éric Brier, Marc Joye. International Conference on Theory and Practice of Public Key Cryptography, 2002
353 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Information Systems
View Paper: https://www.semanticscholar.org/paper/aba3474052dff485ca23c7262b078d110570b065
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Tanja Lange
- Daniel J. Bernstein
- Dengguo Feng
- Yongbin Zhou
- Sung-Ming Yen
- Marc Joye
- Peter Schwabe
- Jean-Pierre Seifert
In Information Systems
- Tanja Lange
- Daniel J. Bernstein
- Dengguo Feng
- Yongbin Zhou
- Sung-Ming Yen
- Marc Joye
- Peter Schwabe
- George Danezis
Citations in the corpus
- Side-Channel Attacks: Ten Years After Its Publication and the Impacts on Cryptographic Module Security Testing (2005, methodology): “[16] E.”
- The Montgomery Powering Ladder (2002, methodology): “This was extended to fields K of characteristic p> 3 in [18,19] (see also [ 3 ,6,8] for general Weierstras elliptic curves).”
- Faster Addition and Doubling on Elliptic Curves (2007, background): “Brier and Joye in [13] presented unified addition formulas for projective (and affine) coordinates; see also [12].”