• DocumentCode
    2890915
  • Title

    The cost of cryptography: Is low budget possible?

  • Author

    Verbauwhede, Ingrid

  • Author_Institution
    ESAT/COSIC, K.U. Leuven, Leuven, Belgium
  • fYear
    2011
  • fDate
    13-15 July 2011
  • Firstpage
    133
  • Lastpage
    133
  • Abstract
    Summary form only given. Ambient intelligence, the future internet, smart dust, all lead to the immersion of electronics in the human environment. E-health applications are one example: patients will carry intelligent sensors and actuators which are wireless connected to monitoring devices and health professionals. All these applications carry heavy security and privacy risks. Strong authentication is needed such that the correct medical doses can be administered or that the settings of brain stimulants cannot be modified. On top, these devices have typically an extremely limited power, energy and area budget. So, the question is: can we provide secure implementations of cryptographic algorithms for these next generation applications? Cost can be expressed in memory footprint or gate count, number of clock cycles or time budget, power and energy budgets. On top, making implementations secure against physical attacks has an extra cost. In this presentation, we will discuss the implementation cost of several cryptographic algorithms, including public key, secret key and hash examples. We will indicate future directions in this field.
  • Keywords
    biomedical communication; cryptography; E-health applications; brain stimulants; cryptographic algorithms; future Internet; health professionals; intelligent actuators; intelligent sensors; monitoring devices; privacy risks; public key cryptography; secret key cryptography; security risks; Communication system security; Logic gates; Public key; Wireless communication; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    On-Line Testing Symposium (IOLTS), 2011 IEEE 17th International
  • Conference_Location
    Athens
  • Print_ISBN
    978-1-4577-1053-7
  • Type

    conf

  • DOI
    10.1109/IOLTS.2011.5993824
  • Filename
    5993824