PIECC: Point Inversion algorithm for Elliptic Curve Cryptology to Secure IoT Data Communication

[1]  Arnaud Tisserand,et al.  Hyper-threaded multiplier for HECC , 2017, 2017 51st Asilomar Conference on Signals, Systems, and Computers.

[2]  Bahram Rashidi,et al.  Low-Cost and Fast Hardware Implementations of Point Multiplication on Binary Edwards Curves , 2018, Electrical Engineering (ICEE), Iranian Conference on.

[3]  Paul Zbinden,et al.  Flexible FPGA-Based Architectures for Curve Point Multiplication over GF(p) , 2016, 2016 Euromicro Conference on Digital System Design (DSD).

[5]  Hwajeong Seo,et al.  On Emerging Family of Elliptic Curves to Secure Internet of Things: ECC Comes of Age , 2017, IEEE Transactions on Dependable and Secure Computing.

[6]  Yinan Kong,et al.  FPGA-based efficient modular multiplication for Elliptic Curve Cryptography , 2015, 2015 International Telecommunication Networks and Applications Conference (ITNAC).

[7]  Xiang Feng,et al.  RLWE-Oriented High-Speed Polynomial Multiplier Utilizing Multi-Lane Stockham NTT Algorithm , 2020, IEEE Transactions on Circuits and Systems II: Express Briefs.

[8]  Shuguo Li,et al.  Broken-Karatsuba multiplication and its application to Montgomery modular multiplication , 2017, 2017 27th International Conference on Field Programmable Logic and Applications (FPL).

[9]  Arnaud Tisserand,et al.  Generation of Finely-Pipelined GF(PP) Multipliers for Flexible Curve Based Cryptography on FPGAs , 2019, IEEE Trans. Computers.

[10]  Erich Wenger,et al.  An 8-bit AVR-Based Elliptic Curve Cryptographic RISC Processor for the Internet of Things , 2012, 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture Workshops.

[11]  Raziyeh Salarifard,et al.  A Low-Latency and Low-Complexity Point-Multiplication in ECC , 2018, IEEE Transactions on Circuits and Systems I: Regular Papers.

[12]  Debdeep Mukhopadhyay,et al.  High-Speed Implementation of ECC Scalar Multiplication in GF(p) for Generic Montgomery Curves , 2019, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[13]  Zhen Gu,et al.  A Generalized RNS Mclaughlin Modular Multiplication with Non-Coprime Moduli Sets , 2019, IEEE Transactions on Computers.

[14]  Belgacem Hamdi,et al.  An Efficient Fault Detection Method for Elliptic Curve Scalar Multiplication Montgomery Algorithm , 2019, 2019 IEEE International Conference on Design & Test of Integrated Micro & Nano-Systems (DTS).

[15]  Bao Li,et al.  Montgomery Algorithm over a Prime Field , 2019, Chinese Journal of Electronics.

[16]  Shuguo Li,et al.  A Low-Latency and Low-Cost Montgomery Modular Multiplier Based on NLP Multiplication , 2020, IEEE Transactions on Circuits and Systems II: Express Briefs.

[17]  Shuguo Li,et al.  High-Performance Pipelined Architecture of Point Multiplication on Koblitz Curves , 2018, IEEE Transactions on Circuits and Systems II: Express Briefs.

[18]  Arash Reyhani-Masoleh,et al.  New Regular Radix-8 Scheme for Elliptic Curve Scalar Multiplication without Pre-Computation , 2015, IEEE Transactions on Computers.

[19]  Murat Cenk,et al.  Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC , 2018, IEEE Transactions on Circuits and Systems I: Regular Papers.

[20]  M. Al-Asli,et al.  FPGA-Based Symmetric Re-Encryption Scheme to Secure Data Processing for Cloud-Integrated Internet of Things , 2019, IEEE Internet of Things Journal.

[21]  Debdeep Mukhopadhyay,et al.  Revisiting FPGA Implementation of Montgomery Multiplier in Redundant Number System for Efficient ECC Application in GF(p) , 2018, 2018 28th International Conference on Field Programmable Logic and Applications (FPL).

[22]  Dawu Gu,et al.  Efficient and Constant Time Modular Inversions Over Prime Fields , 2017, 2017 13th International Conference on Computational Intelligence and Security (CIS).

[23]  Seok-Bum Ko,et al.  Scalable Elliptic Curve Cryptosystem FPGA Processor for NIST Prime Curves , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.