. .. , 94 4.2 État de l'art des implantations de HECC sur FPGA, p.99

. .. , Objectifs et contraintes de nos accélérateurs matériels, p.102

. .. Accélérateurs, Choix des unités et exploration d'architectures d'

.. .. Architectures, 5.2 Architecture A2 : optimisation de l'unité

.. .. Comparaisons,

, Nouveaux accélérateurs utilisant la version F44B de HTMM, p.131

.. .. Conclusions,

G. Gallin, T. O. Celik, and A. Tisserand, Architecture level optimizations for Kummer based HECC on FPGAs, Proc. 18th International Conference on Cryptology in India (Indocrypt), vol.94, p.135, 2017.
DOI : 10.1007/978-3-319-71667-1_3

URL : https://hal.archives-ouvertes.fr/hal-01614063

G. Gallin and A. Tisserand, Camera ready at https://hal. archives-ouvertes.fr/hal-01620046, Asilomar Conference on Signals, Systems and Computers, vol.133, p.136, 2017.

G. Gallin and A. Tisserand, Generation of hyper-threaded GF(P) multipliers for flexible curve based cryptography on FPGAs, IEEE Transactions on Computers, vol.132, p.136, 2018.

G. Gallin and A. Tisserand, Generator for hyper-threaded modular multipliers, vol.58, p.136, 2018.
DOI : 10.1109/acssc.2017.8335378

URL : https://hal.archives-ouvertes.fr/hal-01620046/file/article-asilomar17-htmm.pdf

, Références non citées

G. Gallin, Architectures matérielles pour la cryptographie sur courbes hyper-elliptiques, Séminaire sécurité des systèmes électroniques embarqués DGA -IRISA, 2017.

G. Gallin and A. Tisserand, Comparaison expérimentale d'architectures de cryptoprocesseurs pour courbes elliptiques et hyper-elliptiques, Journées nationales Codage et Cryptographie (JC2), 2015.

G. Gallin and A. Tisserand, Hardware and arithmetic for hyperelliptic curves cryptography, Colloque annuel international du labex CominLabs, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01404755

G. Gallin and A. Tisserand, Architecture level optimizations for Kummer based HECC on FPGAs, 15th International Workshop on cryptographic architectures embedded in logic devices (CryptArchi), 2017.
DOI : 10.1007/978-3-319-71667-1_3

URL : https://hal.archives-ouvertes.fr/hal-01614063

G. Gallin and A. Tisserand, Finite field multiplier architectures for hyper-elliptic curve cryptography. 12ème Colloque national du GDR SOC2, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01539852

G. Gallin and A. Tisserand, Hardware architectures exploration for hyper-elliptic curve cryptography. 6ème Colloque national Crypto'Puces, Talk by G. Gallin (slides available at, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01547034

G. Gallin, N. Veyrat-charvillon, and A. Tisserand, Comparaison expérimentale d'architectures de crypto-processeurs pour courbes elliptiques et hyper-elliptiques, Proc. Conférence nationale d'informatique en Parallélisme, Architecture et Système (Compas), 2015.

G. Gallin, N. Veyrat-charvillon, and A. Tisserand, Experimental comparison of cryptoprocessors architectures for elliptic and hyper-elliptic curves cryptography, 13th International Workshop on cryptographic architectures embedded in logic devices (CryptArchi), 2015.
URL : https://hal.archives-ouvertes.fr/hal-01197048

G. Gallin, N. Veyrat-charvillon, and A. Tisserand, Hardware and arithmetic for hyperelliptic curves cryptography, Rencontres nationales Arithmétiques de l'Informatique Mathématique (RAIM), 2015. Poster available at
URL : https://hal.archives-ouvertes.fr/hal-01404755

G. Gallin, N. Veyrat-charvillon, and A. Tisserand, Hardware and arithmetic for hyperelliptic curves cryptography, Colloque annuel international du labex CominLabs, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01404755

H. Ahmadi, A. Afzali-kusha, M. Pedram, and M. Mosaffa, Flexible prime-field genus 2 hyperelliptic curve cryptography processor with low power consumption and uniform power draw, ETRI journal, vol.37, issue.1, p.99, 2015.

D. Amiet, A. Curiger, and P. Zbinden, Flexible FPGA-based architectures for curve point multiplication over GF(p), Euromicro Conf. on Digital System Design (DSD), vol.58, p.83, 2016.

A. , Avis relatif aux paramètres de courbes elliptiques définis par l'État français, p.19, 2011.

H. Alrimeih and D. Rakhmatov, Fast and flexible hardware support for ECC over multiple standard prime fields, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.22, issue.12, p.127, 2014.

N. Alimi, A. Sghaier, M. Machhout, and R. Tourki, Exploring the design space of curvebased cryptographic accelerators, Proc. International Conference on Engineering MIS (ICEMIS), p.98, 2017.

R. M. Avanzi, Aspects of hyperelliptic curves over large prime fields in software implementations, Proc. 6th International Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol.3156, p.4, 2004.

P. Barrett, Communications Authentication and Security Using Public Key Encryption : A Design for Implementation, vol.16, p.48, 1984.

J. W. Bos, C. Costello, H. Hisil, and K. Lauter, Fast cryptography in genus 2, Journal of Cryptology, vol.29, issue.1, p.35, 2014.

N. Boston, T. Clancy, Y. Liow, and J. Webster, Genus two hyperelliptic curve coprocessor, Proc. 4th International Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol.2523, p.95, 2002.

E. Barker, L. Chen, A. Roginsky, A. Vassilev, and R. Davis, SP 800-56A : Recommendation for pair-wise key-establishment schemes using discrete logarithm cryptography, NIST Special Publication, p.4, 2018.

D. C. Black, J. Donovan, B. Bunton, and A. Keist, SystemC : From the Ground Up, p.112, 2009.

D. Boneh, R. A. Demillo, and R. J. Lipton, On the importance of checking cryptographic protocols for faults, Proc. International Conference on the Theory and Applications of Cryptographic Techniques -Advances in Cryptology (EUROCRYPT), vol.1233, p.7, 1997.

D. J. Bernstein, N. Duif, T. Lange, P. Schwabe, and B. Yang, High-speed high-security signatures, Proc. 13th International Conference on Cryptographic Hardware and Embedded Systems (CHES), vol.6917, p.37, 2011.

D. J. Bernstein, N. Duif, T. Lange, P. Schwabe, and B. Yang, High-speed high-security signatures, Journal of Cryptographic Engineering, vol.2, issue.2, p.140, 2012.

D. J. Bernstein, Curve25519 : New Diffie-Hellman speed records, Proc. 9th International Workshop on Public Key Cryptography (PKC), vol.3958, p.129, 2006.

E. Brier and M. Joye, Weierstraß elliptic curves and side-channel attacks, Proc. 5th International Workshop on Public Key Cryptography (PKC), vol.2274, p.28, 2002.

D. J. Bernstein and T. Lange, Explicit-formulas database, vol.19, p.22

D. J. Bernstein and T. Lange, Safecurves : choosing safe curves for elliptic-curve cryptography, vol.18, p.95, 2013.

G. R. Blakley, A computer algorithm for calculating the product A*B modulo M, IEEE Trans. on Comp., C, vol.32, issue.5, p.48, 1983.

L. Batina, N. Mentens, B. Preneel, and I. Verbauwhede, Flexible hardware architectures for curve-based cryptography, Proc. IEEE International Symposium on Circuits and Systems (ISCAS), p.97, 2006.

T. Blum and C. Paar, High-radix Montgomery modular exponentiation on reconfigurable hardware, IEEE Trans. on Comp, vol.50, issue.7, p.58, 2001.

D. G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Mathematics of Computation, vol.48, issue.177, p.98, 1987.

H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange et al., Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and Its Applications, vol.14, p.98, 2005.

L. Cai and D. Gajski, Transaction level modeling : An overview, Proc. 1st IEEE/ACM/I-FIP International Conference on Hardware/Software Codesign and System Synthesis, p.111, 2003.

C. Costello and P. Longa, FourQ : Four-dimensional decompositions on a Q-curve over the Mersenne prime, Proc. 21st International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), vol.9452, p.130, 2015.

J. Coron, Resistance against differential power analysis for elliptic curve cryptosystems, Proc. 1st International Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol.1717, p.28, 1999.

F. De-dinechin and B. Pasca, Large multipliers with fewer DSP blocks, Proc. 19th International Conference on Field Programmable Logic and Applications (FPL), p.63, 2009.

W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, p.36, 1976.

S. R. Dusse and B. S. Kaliski, A cryptographic library for the Motorola DSP56000, Proc. Workshop on the Theory and Application of Cryptographic Techniques -Advances in Cryptology (EUROCRYPT), vol.12, p.51, 1990.

G. Elias, A. Miri, and T. Yeap, On efficient implementation of FPGA-based hyperelliptic curve cryptosystems, Computers & Electrical Engineering, vol.33, issue.5, p.97, 2007.

J. Fan, L. Batina, and I. Verbauwhede, HECC goes embedded : an area-efficient implementation of HECC, Proc. 15th Workshop on Selected Areas in Cryptography (SAC), vol.5381, p.97, 2008.

J. Fan and I. Verbauwhede, An updated survey on secure ECC implementations : Attacks, countermeasures and cost, Cryptography and Security : From Theory to Applications -Essays dedicated to Jean-Jacques Quisquater on the occasion of his 65th birthday, p.28, 2012.

S. Gao, D. Al-khalili, N. Chabini, and P. Langlois, Asymmetric large size multipliers with optimised FPGA resource utilisation, IET Computers & Digital Techniques, vol.6, p.63, 2012.

P. Gaudry, Fast genus 2 arithmetic based on theta functions, Journal of Mathematical Cryptology, vol.1, issue.3, p.35, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00000625

S. D. Galbraith and P. Gaudry, Recent progress on the elliptic curve discrete logarithm problem. Designs, Codes and Cryptography, vol.78, p.6, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01215623

P. Gaudry and R. Harley, Counting points on hyperelliptic curves over finite fields, Proc. 4th Symposium on Algorithmic Number Theory (ANTS), vol.4, p.34, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00512403

S. Ghosh, D. Mukhopadhyay, and D. Chowdhury, High speed Fp multipliers and adders on FPGA platform, Conf. Design and Architectures for Signal and Image Processing (DASIP), p.48, 2010.

T. Guneysu and C. Paar, Ultra high performance ECC over NIST primes on commercial FPGAs, Proc. 10th Internaltional Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol.5154, p.127, 2008.

P. Gaudry and E. Schost, Genus 2 point counting over prime fields, Journal of Symbolic Computation, vol.47, issue.4, p.99, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00542650

D. Genkin, L. Valenta, and Y. Yarom, May the fourth be with you : A microarchitectural side channel attack on several real-world applications of Curve25519, Proc. of the 24th ACM SIGSAC Conference on Computer and Communications Security (CCS), p.6, 2017.

, HAH -hardware and arithmetic for hyperelliptic curves cryptography, p.5

M. Hamburg, Ed448-Goldilocks, a new elliptic curve, Cryptology ePrint Archive, vol.625, p.19, 2015.

R. Harley, Fast arithmetic on genus 2 curves, vol.32, p.98, 2000.

M. Huang, K. Gaj, and T. El-ghazawi, New hardware architectures for Montgomery modular multiplication algorithm, IEEE Trans. on Comp, vol.60, issue.7, p.59, 2011.

D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography, vol.37, p.104, 2004.

. Ieee and . Ieee, Standard for Standard SystemC Language Reference Manual -Redline, Revision of IEEE Std 1666-2005) -Redline, p.112, 2012.

K. Jarvinen, A. Miele, R. Azarderakhsh, and P. Longa, FourQ on FPGA : New hardware speed records for elliptic curve cryptography over large prime characteristic fields, Proc. 18th International Conference on Cryptographic Hardware and Embedded Systems (CHES), vol.9813, p.129, 2016.

M. Joye and J. Quisquater, Hessian elliptic curves and side-channel attacks, Proc. 3rd International Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol.2162, p.28, 2001.

K. Javeed, X. Wang, and M. Scott, Serial and parallel interleaved modular multipliers on FPGA platform, Internat. Conf. on Field Programmable Logic and Applications (FPL), p.48, 2015.

K. Javeed, X. Wang, and M. Scott, High performance hardware support for elliptic curve cryptography over general prime field, Microprocessors and Microsystems, vol.51, p.48, 2017.

M. Joye and S. Yen, The Montgomery powering ladder, Proc. 4th International Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol.2523, p.29, 2002.

C. K. Koc, T. Acar, B. S. Kaliski, and J. , Analyzing and comparing Montgomery multiplication algorithms, IEEE Micro, vol.16, issue.3, p.135, 1996.

B. S. Kaliski, The Z80180 and big-number arithmetic. Dr Dobb's Journal-Software Tools for the Professional Programmer, vol.18, p.55, 1993.

C. F. Kerry and P. D. Gallagher, FIPS PUB 186-4 : Digital signature standard

, Federal Information Processing Standards Publication, vol.36, p.37, 2013.

P. C. Kocher, J. Jaffe, and B. Jun, Differential power analysis, Proc. 19th International Cryptology Conference -Advances in Cryptology (CRYPTO), vol.7, p.27, 1999.

D. Koufaty and D. T. Marr, Hyperthreading technology in the netburst microarchitecture, IEEE Micro, vol.23, issue.2, p.136, 2003.

N. Koblitz and A. Menezes, A riddle wrapped in an enigma, Cryptology ePrint Archive, p.5, 1018.

D. E. Knuth, The art of computer programming, Seminumerical algorithms, vol.2, p.23, 1998.

N. Koblitz, Elliptic curve cryptosystems, Mathematics of computation, vol.48, issue.177, p.14, 1987.

N. Koblitz, A family of Jacobians suitable for discrete log cryptosystems, Proc. 5th Conference on the Theory and Application of Cryptography -Advances in Cryptology (CRYPTO), vol.403, p.95, 1988.

N. Koblitz, Hyperelliptic cryptosystems, Journal of Cryptology, vol.1, issue.3, p.95, 1989.

P. C. Kocher, Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems, Proc. 16th International Cryptology Conference -Advances in Cryptology (CRYPTO), vol.7, p.27, 1996.

P. Koppermann, F. De, J. Santis, G. Heyszl, and . Sigl, Fast FPGA implementations of DiffieHellman on the Kummer surface of a genus-2 curve. IACR Transactions on Cryptographic Hardware and Embedded Systems, vol.2018, p.103, 2018.

M. Knezevic, F. Vercauteren, and I. Verbauwhede, Faster interleaved modular multiplication based on Barrett and Montgomery reduction methods, IEEE Trans. on Comp, vol.59, issue.12, p.48, 2010.

H. W. Kim, T. Wollinger, Y. J. Choi, K. I. Chung, and C. Paar, Hyperelliptic curve coprocessors on a FPGA, Proc. 5th International Workshop on Information Security Applications (WISA), vol.3325, p.97, 2004.

P. Lacharme, Sécurité du passeport électronique : 10 ans après son lancement, quelles lecons en tirer ? In 8ème conférence sur la sécurité des architectures réseaux et des systèmes d'information (SARSSI), p.4, 2013.

T. Lange, Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves. Cryptology ePrint Archive, vol.4, p.33, 2002.

T. Lange, Formulae for Arithmetic on Genus 2 Hyperelliptic Curves, vol.15, p.135, 2005.

H. W. Lenstra, Factoring integers with elliptic curves, Annals of Mathematics, vol.126, issue.3, p.3, 1987.

A. K. Lenstra, H. W. Lenstra, M. S. Manasse, and J. M. Pollard, The number field sieve, The development of the number field sieve, vol.1554, p.3, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00108061

T. Lange and P. K. Mishra, SCA resistant parallel explicit formula for addition and doubling of divisors in the Jacobian of hyperelliptic curves of genus 2, Proc. 6th International Conference on Cryptology in India (Indocrypt), vol.3797, p.33, 2005.

M. Lochter and J. Merkle, ECC brainpool standard curves & curve generation, p.19, 2010.

P. Liardet and N. Smart, Preventing SPA/DPA in ECC systems using the Jacobi form, Proc. 3rd International Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol.2162, p.28, 2001.

J. Lai, Y. Wang, and C. Huang, High-performance architecture for elliptic curve cryptography over prime fields on FPGAs, Interdisciplinary Information Sciences, vol.18, issue.2, p.127, 2012.

P. M. Massolino, L. Batina, R. Chaves, and N. Mentens, Area-optimized Montgomery multiplication on IGLOO2 FPGAs, Internat. Conf. Field Programmable Logic and Applications (FPL), vol.59, p.78, 2017.

A. Mrabet, N. El-mrabet, R. Lashermes, J. Rigaud, B. Bouallegue et al., A scalable and systolic architectures of Montgomery modular multiplication for public key cryptosystems based on DSPs, Journal of Hardware and Systems Security, vol.1, issue.3, p.78, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01579811

R. C. Merkle, Secure communications over insecure channels, Communications of the ACM, vol.21, issue.4, p.3, 1978.

J. Métairie, m ) et leurs applications à la cryptographie sur courbes elliptiques, Contributions aux opérateurs arithmétiques GF, p.17, 2016.

V. S. Miller, Use of elliptic curves in cryptography, Proc. Conference on the Theory and Application of Cryptographic techniques -Advances in Cryptology (CRYPTO), vol.218, p.14, 1985.

Y. Ma, Z. Liu, W. Pan, and J. Jing, A high-speed elliptic curve cryptographic processor for generic curves over GF(p), Proc. International Workshop on Selected Areas in Cryptography (SAC), vol.8282, p.129, 2013.

C. Mcivor, M. Mcloone, and J. Mccanny, FPGA Montgomery modular multiplication architectures suitable for ECCs over GF(p), IEEE Internat. Symp. on Circuits and Systems (ISCAS), vol.3, p.54, 2004.

C. Mcivor, M. Mcloone, and J. Mccanny, FPGA Montgomery multiplier architectures -a comparison, IEEE Symp. Field-Programmable Custom Computing Machines (FCCM), p.54, 2004.

M. Mcloone, C. Mcivor, and J. Mccanny, Coarsely integrated operand scanning (CIOS) architecture for high-speed Montgomery modular multiplication, IEEE Internat. Conf. on Field-Programmable Technology, p.54, 2004.

C. Mcivor, M. Mcloone, and J. Mccanny, High-radix systolic modular multiplication on reconfigurable hardware, IEEE Internat. Conf. on Field-Programmable Technology, p.58, 2005.

P. L. Montgomery, Modular multiplication without trial division, Math. of Comp, vol.44, issue.170, p.52, 1985.

P. L. Montgomery, Speeding the Pollar and elliptic curves methods of factorisation. Mathematics of Computation, vol.48, p.100, 1987.

S. Mangard, E. Oswald, and T. Popp, Power analysis attacks : Revealing the secrets of smart cards, vol.31, p.27, 2008.

M. Morales-sandoval and A. Diaz-perez, Scalable GF(p) Montgomery multiplier based on a digit-digit computation approach, IET Computers & Digital Techniques, vol.10, issue.3, p.78, 2016.

, NISTIR 8105 : Report on post-quantum cryptography, p.5, 2016.

S. Ors, L. Batina, B. Preneel, and J. Vandewalle, Hardware implementation of a Montgomery modular multiplier in a systolic array, Internat. Parallel and Distributed Processing Symp, p.58, 2003.

H. Orup, Simplifying quotient determination in high-radix modular multiplication, Symp. on Computer Arithmetic (ARITH), vol.54, p.129, 1995.

C. Petit and J. Quisquater, On polynomial systems arising from a Weil descent, Proc. 18th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), vol.18, p.95, 2012.

J. Pelzl, T. Wollinger, and C. Paar, High performance arithmetic for special hyperelliptic curve cryptosystems of genus two, Proc. International Conference on Information Technology : Coding and Computing (ITCC), vol.2, p.96, 2004.

D. B. Roy, D. Mukhopadhyay, M. Izumi, and J. Takahashi, Tile before multiplication : An efficient strategy to optimize DSP multiplier for accelerating prime field ECC for NIST curves, Proc. 51st Annual Design Automation Conference (DAC), p.63, 2014.

R. L. Rivest, A. Shamir, and L. Adleman, Massachusetts Institute of Technology (MIT), Cambridge lab. for computer science, p.3, 1977.

R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, p.12, 1978.

J. Renes, P. Schwabe, B. Smith, and L. Batina, µKummer : Efficient hyperelliptic signatures and key exchange on microcontrollers, Proc. 18th International Conference on Cryptographic Hardware and Embedded Systems (CHES), vol.9813, p.136, 2016.

, Side-channel AttacK User Reference Architecture, issue.SAKURA, p.114, 2013.

K. Sakiyama, L. Batina, B. Preneel, and I. Verbauwhede, Superscalar coprocessor for highspeed curve-based cryptography, Proc. 8th International Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol.4249, p.96, 2006.

S. Srinath and K. Compton, Automatic generation of high-performance multipliers for FPGAs with asymmetric multiplier blocks, Proc. 18th Annual ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA), p.63, 2010.

R. Scheidler, Hyperelliptic curve arithmetic. Slides presented at the 12th International Conference on Finite Fields and Their Applications -available at, p.32, 2015.

, Standards for efficient cryptography -SEC2 : Recommended elliptic curve domain parameters v2.0. Certicom Research, www.secg.org/sec2-v2.pdf, vol.19, p.28, 2010.

P. Sasdrich and T. Guneysu, Implementing Curve25519 for side-channel-protected elliptic curve cryptography, ACM Trans. Reconfigurable Technol. Syst, vol.9, issue.1, p.130, 2015.

P. Sasdrich and T. Guneysu, Cryptography for next generation TLS : Implementing the RFC 7748 elliptic curve448 cryptosystem in hardware, Proc. 54th Annual Design Automation Conference (DAC), vol.16, p.19, 2017.

N. P. Smart, On the performance of hyperelliptic cryptosystems, Proc. International Conference on the Theory and Applications of Cryptographic Techniques -Advances in Cryptology (EUROCRYPT), p.4, 1999.

A. Sghaier, C. Massoud, M. Zeghid, and M. Machhout, Flexible hardware implementation of hyperelliptic curves cryptosystem, International Journal of Computer Science and Information Security (IJCSIS), vol.14, issue.4, p.98, 2016.

N. P. Smart and S. Siksek, A fast Diffie-Hellman protocol in genus 2, Journal of Cryptology, vol.12, issue.1, p.34, 1999.

Y. Sakai, K. Sakurai, and H. Ishizuka, Secure hyperelliptic cryptosystems and their performance, Proc. 1st International Workshop on Public Key Cryptography (PKC), p.4, 1998.

D. Suzuki, How to maximize te potential of FPGA resources for modular exponentiation, Proc. 9th International Workshop on Cryptographic Hardware and Embedded Systems (CHES), p.57, 2007.

A. F. Tenca and C. K. Koc, A scalable architecture for Montgomery multiplication, Proc. 1st International Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol.1717, p.59, 1999.

A. F. Tenca and C. K. Koc, A scalable architecture for modular multiplication based on Montgomery's algorithm, IEEE Trans. on Comp, vol.52, issue.9, p.59, 2003.

A. F. Tenca and L. A. Tawalbeh, An efficient and scalable radix-4 modular multiplier design using recoding techniques, Asilomar Conf. on Signals, vol.2, p.59, 2003.

A. F. Tenca, G. Todorov, and C. K. Koc, High-radix design of a scalable modular multiplier, Proc. 3rd International Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol.2162, p.59, 2001.

C. D. Walter, Systolic modular multiplication, IEEE Trans. on Comp, vol.42, issue.3, p.58, 1993.

C. D. Walter, Montgomery exponentiation needs no final subtractions, Electronics Letters, vol.35, issue.21, p.75, 1999.

T. Wollinger, Computer architectures for cryptosystems based on hyperelliptic curves, p.95, 2001.

T. Wollinger, Software and hardware implementation of hyperelliptic curve cryptosystems, p.96, 2004.

T. Wollinger, J. Pelzl, and C. Paar, Cantor versus Harley : optimization and analysis of explicit formulae for hyperelliptic curve cryptosystems, IEEE Transactions on Computers, vol.54, issue.7, p.135, 2005.

. Xilinx, UG070 : Virtex-4 User Guide, vol.43, p.47, 2008.

. Xilinx, UG073 : XtremeDSP for Virtex-4 FPGAs User Guide, p.44, 2008.

. Xilinx, Virtex-4 FPGA Data Sheet 302 : DC and Switching Characteristics, p.45, 2009.

. Xilinx, UG384 : Spartan-6 Configurable Logic Block User Guide, vol.42, p.43, 2010.

. Xilinx, UG383 : Spartan-6 FPGA Block RAM Resources User Guide, vol.45, p.47, 2011.

. Xilinx, UG190 : Virtex-5 User Guide, vol.43, p.47, 2012.

. Xilinx, UG193 : Virtex-5 FPGA XtremeDSP Design Considerations User Guide, p.44, 2012.

. Xilinx, Virtex-5 FPGA Data Sheet 202 : DC and Switching Characteristics, p.45, 2014.

. Xilinx, Spartan-6 FPGA Data Sheet 162 : DC and AC Switching Characteristics, p.45, 2015.

. Xilinx, UG473 : 7 Series FPGAs Memory Resources User Guide, p.47, 2016.

. Xilinx, UG474 : 7 Series FPGAs Configurable Logic Block User Guide, p.43, 2016.

. Xilinx, Virtex-7 T and XT FPGAs Data Sheet 183 : DC and AC Switching Characteristics, vol.27, p.46, 2017.

. Xilinx, UG479 : 7 Series DSP48E1 Slice User Guide, vol.44, p.46, 2018.

S. Yen and M. Joye, Checking before output may not be enough against fault-based cryptanalysis, IEEE Transactions on Computers, vol.49, issue.9, p.27, 2000.