PRINCEv2 - More Security for (Almost) No Overhead

Dušan Božilov; Maria Eichlseder; Miroslav Knezevic; Baptiste Lambin; Gregor Leander; Thorben Moos; Ventzislav Nikov; Shahram Rasoolzadeh; Yosuke Todo; Friedrich Wiemer

doi:10.1007/978-3-030-81652-0_19

PRINCEv2 - More Security for (Almost) No Overhead

Dušan Božilov, Maria Eichlseder, Miroslav Knezevic, Baptiste Lambin, Gregor Leander, Thorben Moos, Ventzislav Nikov, Shahram Rasoolzadeh, Yosuke Todo, Friedrich Wiemer

Institut für Angewandte Informationsverarbeitung und Kommunikationstechnologie (7050)

Publikation: Beitrag in Buch/Bericht/Konferenzband › Beitrag in einem Konferenzband › Begutachtung

Abstract

In this work, we propose tweaks to the PRINCE block cipher that help us to increase its security without changing the number of rounds or round operations. We get substantially higher security for the same complexity. From an implementation perspective, PRINCEv2 comes at an extremely low overhead compared to PRINCE in all key categories, such as area, latency and energy. We expect, as it is already the case for PRINCE, that the new cipher PRINCEv2 will be deployed in various settings

Originalsprache	englisch
Titel	Selected Areas in Cryptography
Untertitel	27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers
Redakteure/-innen	Orr Dunkelman, Michael J. Jacobson, Jr., Colin O'Flynn
Erscheinungsort	Cham
Herausgeber (Verlag)	Springer
Seiten	483-511
Seitenumfang	29
ISBN (elektronisch)	978-3-030-81652-0
ISBN (Print)	978-3-030-81651-3
DOIs	https://doi.org/10.1007/978-3-030-81652-0_19
Publikationsstatus	Veröffentlicht - 2021
Veranstaltung	27th International Conference on Selected Areas in Cryptography: SAC 2020 - Virtuell, Kanada Dauer: 19 Okt. 2020 → 23 Okt. 2020

Publikationsreihe

Name	Lecture Notes in Computer Science
Band	12804

Konferenz

Konferenz	27th International Conference on Selected Areas in Cryptography
Kurztitel	SAC 2020
Land/Gebiet	Kanada
Zeitraum	19/10/20 → 23/10/20

ASJC Scopus subject areas

Theoretische Informatik
Informatik (insg.)

Zugriff auf Dokument

10.1007/978-3-030-81652-0_19

https://eprint.iacr.org/2020/1269Lizenz: CC BY 4.0

Andere Dateien und Links

http://www.scopus.com/inward/record.url?scp=85113472192&partnerID=8YFLogxK

Dieses zitieren

Božilov, D., Eichlseder, M., Knezevic, M., Lambin, B., Leander, G., Moos, T., Nikov, V., Rasoolzadeh, S., Todo, Y., & Wiemer, F. (2021). PRINCEv2 - More Security for (Almost) No Overhead. in O. Dunkelman, M. J. Jacobson, Jr., & C. O'Flynn (Hrsg.), Selected Areas in Cryptography : 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers (S. 483-511). (Lecture Notes in Computer Science; Band 12804). Springer. https://doi.org/10.1007/978-3-030-81652-0_19

PRINCEv2 - More Security for (Almost) No Overhead. / Božilov, Dušan; Eichlseder, Maria; Knezevic, Miroslav et al.
Selected Areas in Cryptography : 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers. Hrsg. / Orr Dunkelman; Michael J. Jacobson, Jr.; Colin O'Flynn. Cham: Springer, 2021. S. 483-511 (Lecture Notes in Computer Science; Band 12804).

Publikation: Beitrag in Buch/Bericht/Konferenzband › Beitrag in einem Konferenzband › Begutachtung

Božilov, D, Eichlseder, M, Knezevic, M, Lambin, B, Leander, G, Moos, T, Nikov, V, Rasoolzadeh, S, Todo, Y & Wiemer, F 2021, PRINCEv2 - More Security for (Almost) No Overhead. in O Dunkelman, MJ Jacobson, Jr. & C O'Flynn (Hrsg.), Selected Areas in Cryptography : 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers. Lecture Notes in Computer Science, Bd. 12804, Springer, Cham, S. 483-511, 27th International Conference on Selected Areas in Cryptography, Kanada, 19/10/20. https://doi.org/10.1007/978-3-030-81652-0_19

Božilov D, Eichlseder M, Knezevic M, Lambin B, Leander G, Moos T et al. PRINCEv2 - More Security for (Almost) No Overhead. in Dunkelman O, Jacobson, Jr. MJ, O'Flynn C, Hrsg., Selected Areas in Cryptography : 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers. Cham: Springer. 2021. S. 483-511. (Lecture Notes in Computer Science). doi: 10.1007/978-3-030-81652-0_19

Božilov, Dušan ; Eichlseder, Maria ; Knezevic, Miroslav et al. / PRINCEv2 - More Security for (Almost) No Overhead. Selected Areas in Cryptography : 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers. Hrsg. / Orr Dunkelman ; Michael J. Jacobson, Jr. ; Colin O'Flynn. Cham : Springer, 2021. S. 483-511 (Lecture Notes in Computer Science).

@inproceedings{b48219483736431e88fe9ee1addfafaf,

title = "PRINCEv2 - More Security for (Almost) No Overhead",

abstract = "In this work, we propose tweaks to the PRINCE block cipher that help us to increase its security without changing the number of rounds or round operations. We get substantially higher security for the same complexity. From an implementation perspective, PRINCEv2 comes at an extremely low overhead compared to PRINCE in all key categories, such as area, latency and energy. We expect, as it is already the case for PRINCE, that the new cipher PRINCEv2 will be deployed in various settings",

keywords = "Block cipher, Lightweight, Low latency, PRINCE",

author = "Du{\v s}an Bo{\v z}ilov and Maria Eichlseder and Miroslav Knezevic and Baptiste Lambin and Gregor Leander and Thorben Moos and Ventzislav Nikov and Shahram Rasoolzadeh and Yosuke Todo and Friedrich Wiemer",

year = "2021",

doi = "10.1007/978-3-030-81652-0_19",

language = "English",

isbn = "978-3-030-81651-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "483--511",

editor = "Orr Dunkelman and {Jacobson, Jr.}, {Michael J. } and O'Flynn, {Colin }",

booktitle = "Selected Areas in Cryptography",

note = "27th International Conference on Selected Areas in Cryptography : SAC 2020, SAC 2020 ; Conference date: 19-10-2020 Through 23-10-2020",

}

TY - GEN

T1 - PRINCEv2 - More Security for (Almost) No Overhead

AU - Božilov, Dušan

AU - Eichlseder, Maria

AU - Knezevic, Miroslav

AU - Lambin, Baptiste

AU - Leander, Gregor

AU - Moos, Thorben

AU - Nikov, Ventzislav

AU - Rasoolzadeh, Shahram

AU - Todo, Yosuke

AU - Wiemer, Friedrich

PY - 2021

Y1 - 2021

N2 - In this work, we propose tweaks to the PRINCE block cipher that help us to increase its security without changing the number of rounds or round operations. We get substantially higher security for the same complexity. From an implementation perspective, PRINCEv2 comes at an extremely low overhead compared to PRINCE in all key categories, such as area, latency and energy. We expect, as it is already the case for PRINCE, that the new cipher PRINCEv2 will be deployed in various settings

AB - In this work, we propose tweaks to the PRINCE block cipher that help us to increase its security without changing the number of rounds or round operations. We get substantially higher security for the same complexity. From an implementation perspective, PRINCEv2 comes at an extremely low overhead compared to PRINCE in all key categories, such as area, latency and energy. We expect, as it is already the case for PRINCE, that the new cipher PRINCEv2 will be deployed in various settings

KW - Block cipher

KW - Lightweight

KW - Low latency

KW - PRINCE

UR - http://www.scopus.com/inward/record.url?scp=85113472192&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-81652-0_19

DO - 10.1007/978-3-030-81652-0_19

M3 - Conference paper

SN - 978-3-030-81651-3

T3 - Lecture Notes in Computer Science

SP - 483

EP - 511

BT - Selected Areas in Cryptography

A2 - Dunkelman, Orr

A2 - Jacobson, Jr., Michael J.

A2 - O'Flynn, Colin

PB - Springer

CY - Cham

T2 - 27th International Conference on Selected Areas in Cryptography

Y2 - 19 October 2020 through 23 October 2020

ER -

PRINCEv2 - More Security for (Almost) No Overhead

Abstract

Publikationsreihe

Konferenz

ASJC Scopus subject areas

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Dieses zitieren