• Sujoy Sinha RoyEmail author
  • Ingrid Verbauwhede
Part of the Computer Architecture and Design Methodologies book series (CADM)


Since the advent of the internet, our world has become more and more connectedevery day. The International Telecommunications Union reports that the number of internet users has increased from 400 million in 2000 to 3.2 billionin 2015. This growth rate is expected to be faster in the future as a result ofinternet penetration in the developing nations. The Internet of Things (IoT)is a network of connected devices ranging from powerful personal computersand smart phones to low-cost passive RFID tags. These devices are capable of computing together and exchanging information with or without humanintervention and are present in many areas of our life such as smart homes, smart grids, intelligent transportation, smart cities.


  1. 1.
    Azarderakhsh R, Järvinen KU, Mozaffari-Kermani M (2014) Efficient algorithm and architecture for elliptic curve cryptography for extremely constrained secure applications. IEEE Trans Circuits Syst I-Regul Pap 61(4):1144–1155CrossRefGoogle Scholar
  2. 2.
    Barker E, Barker W, Burr W, Polk W, Smid M (2007) Recommendation for key management - part 1: general., March, 2007, Revised January 2016
  3. 3.
    Batina L, Mentens N, Sakiyama K, Preneel B, Verbauwhede I (2006) Low-cost elliptic curve cryptography for wireless sensor networks. In: Security and privacy in ad-hoc and sensor networks—ESAS 2006. Lecture notes in computer science, vol 4357. Springer, Berlin, pp 6–17Google Scholar
  4. 4.
    BBC News (2014) NSA ‘developing code-cracking quantum computer’.
  5. 5.
    Bernstein DJ, Engels S, Lange T, Niederhagen R, Paar C, Schwabe P, Zimmermann R (2016) Faster elliptic-curve discrete logarithms on FPGAs. Cryptology ePrint archive, report 2016/382.
  6. 6.
    Bock H, Braun M, Dichtl M, Hess E, Heyszl J, Kargl W, Koroschetz H, Meyer B, Seuschek H (2008) A milestone towards RFID products offering asymmetric authentication based on elliptic curve cryptography. In: Proceedings of the 4th workshop on RFID security—RFIDSec 2008Google Scholar
  7. 7.
    Hankerson D, Menezes AJ, Vanstone S (2003) Guide to elliptic curve cryptography. Springer, New YorkzbMATHGoogle Scholar
  8. 8.
    Hein D, Wolkerstorfer J, Felber N (2009) ECC is ready for RFID - a proof in silicon. In: Selected areas in cryptography—SAC 2008. Lecture notes in computer science, vol 5381. Springer, Berlin, pp 401–413CrossRefGoogle Scholar
  9. 9.
    Koblitz N (1987) Elliptic curve cryptosystems. Math Comput 48:203–209MathSciNetCrossRefGoogle Scholar
  10. 10.
    Kumar S, Paar C, Pelzl J, Pfeiffer G, Schimmler M (2006) Breaking ciphers with COPACOBANA—a cost-optimized parallel code breaker. In: Cryptographic hardware and embedded systems (CHES 2006). Lecture notes in computer science, vol 4249. Springer, pp 101–118Google Scholar
  11. 11.
    Lee YK, Sakiyama K, Batina L, Verbauwhede I (2008) Elliptic-curve-based security processor for RFID. IEEE Trans Comput 57(11):1514–1527MathSciNetCrossRefGoogle Scholar
  12. 12.
    Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: Advances in cryptology - EUROCRYPT 2010. Lecture notes in computer science, vol 6110. Springer, Berlin, pp 1–23Google Scholar
  13. 13.
    National Institute of Standards and Technology (2009) Discussion paper: the transitioning of cryptographic algorithms and key sizes.
  14. 14.
    National Institute of Standards and Technology (2016) NIST Kicks off effort to defend encrypted data from quantum computer threat.
  15. 15.
    Pessl P, Hutter M (2014) Curved tags—a low-resource ECDSA implementation tailored for RFID. In: Workshop on RFID security—RFIDSec 2014Google Scholar
  16. 16.
    Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM 56(6)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126MathSciNetCrossRefGoogle Scholar
  18. 18.
    Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th annual symposium on foundations of computer science, SFCS ’94. IEEE Computer Society, Washington, pp 124–134Google Scholar
  19. 19.
    I. T. U. Telecommunication Development Bureau (2015) ICT facts and figures.
  20. 20.
    The guardian (2013) The NSA files: Decoded.
  21. 21.
    Wenger E (2013) Hardware architectures for MSP430-based wireless sensor nodes performing elliptic curve cryptography. In: Applied cryptography and network security—ACNS 2013. Lecture notes in computer science, vol 7954. Springer, Berlin, pp 290–306CrossRefGoogle Scholar
  22. 22.
    Wenger E, Hutter M (2011) A hardware processor supporting elliptic curve cryptography for less than 9 kGEs. In: Smart card research and advanced applications—CARDIS 2011. Lecture notes in computer science, vol 7079. Springer, Berlin, pp 182–198CrossRefGoogle Scholar
  23. 23.
    ZDNet (2015) The internet of things and big data: unlocking the power.

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.School of Computer ScienceUniversity of BirminghamBirminghamUK
  2. 2.ESAT—COSICKU LeuvenLeuvenBelgium

Personalised recommendations