Breaking Randomized Mixed-Radix Scalar Multiplication Algorithms
暂无分享,去创建一个
[1] Marc Joye,et al. (Virtually) Free Randomization Techniques for Elliptic Curve Cryptography , 2003, ICICS.
[2] M. Anwar Hasan,et al. Random Digit Representation of Integers , 2016, 2016 IEEE 23nd Symposium on Computer Arithmetic (ARITH).
[3] Manfred Josef Aigner,et al. Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks , 2001, CHES.
[4] JaeCheol Ha,et al. Randomized Signed-Scalar Multiplication of ECC to Resist Power Attacks , 2002, CHES.
[5] Frédéric Valette,et al. Defeating Countermeasures Based on Randomized BSD Representations , 2004, CHES.
[6] David A. Wagner,et al. Hidden Markov Model Cryptanalysis , 2003, CHES.
[7] Peter L. Montgomery,et al. Division by invariant integers using multiplication , 1994, PLDI '94.
[8] D. Bernstein. Differential addition chains , 2006 .
[9] M. Anwar Hasan,et al. On binary signed digit representations of integers , 2007, Des. Codes Cryptogr..
[10] Laurent Imbert,et al. Randomized Mixed-Radix Scalar Multiplication , 2018, IEEE Transactions on Computers.
[11] Arjen K. Lenstra,et al. Topics in computational number theory inspired by Peter L. Montgomery , 2017 .