Academic Journal
PRINCE - A Low-Latency Block Cipher for Pervasive Computing Applications: Extended Abstract
| العنوان: | PRINCE - A Low-Latency Block Cipher for Pervasive Computing Applications: Extended Abstract |
|---|---|
| المؤلفون: | Borghoff, J., Canteaut, Anne Michele, Guneysu, T., Kavun, E.B., Knezevic, M., Knudsen, Lars Ramkilde, Leander, Gregor, Nikov, V., Paar, C., Rechberger, Christian |
| المصدر: | Borghoff , J , Canteaut , A M , Guneysu , T , Kavun , E B , Knezevic , M , Knudsen , L R , Leander , G , Nikov , V , Paar , C & Rechberger , C 2012 , PRINCE - A Low-Latency Block Cipher for Pervasive Computing Applications: Extended Abstract . in Advances in Cryptology – ASIACRYPT 2012 : 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings . Springer , Lecture Notes in Computer Science , vol. 7658 , pp. 208-225 , .... |
| بيانات النشر: | Springer |
| سنة النشر: | 2012 |
| المجموعة: | Technical University of Denmark: DTU Orbit / Danmarks Tekniske Universitet |
| الوصف: | his paper presents a block cipher that is optimized with respect to latency when implemented in hardware. Such ciphers are desirable for many future pervasive applications with real-time security needs. Our cipher, named PRINCE, allows encryption of data within one clock cycle with a very competitive chip area compared to known solutions. The fully unrolled fashion in which such algorithms need to be implemented calls for innovative design choices. The number of rounds must be moderate and rounds must have short delays in hardware. At the same time, the traditional need that a cipher has to be iterative with very similar round functions disappears, an observation that increases the design space for the algorithm. An important further requirement is that realizing decryption and encryption results in minimum additional costs. PRINCE is designed in such a way that the overhead for decryption on top of encryption is negligible. More precisely for our cipher it holds that decryption for one key corresponds to encryption with a related key. This property we refer to as α-reflection is of independent interest and we prove its soundness against generic attacks. |
| نوع الوثيقة: | article in journal/newspaper |
| اللغة: | English |
| ردمك: | 978-3-642-34960-7 3-642-34960-9 |
| Relation: | https://orbit.dtu.dk/en/publications/f7c39395-2294-475d-8fe4-102655401c00; urn:ISBN: 978-3-642-34960-7 |
| DOI: | 10.1007/978-3-642-34961-4_14 |
| الاتاحة: | https://orbit.dtu.dk/en/publications/f7c39395-2294-475d-8fe4-102655401c00 https://doi.org/10.1007/978-3-642-34961-4_14 |
| Rights: | info:eu-repo/semantics/closedAccess |
| رقم الانضمام: | edsbas.BBB803A9 |
| قاعدة البيانات: | BASE |
| ردمك: | 9783642349607 3642349609 |
|---|---|
| DOI: | 10.1007/978-3-642-34961-4_14 |