Simula UiB

The future expects you to be PQC compliant Kristian Augusts gate 23 23 Kristian Augusts gate 0164 Sentrum Norway Good to know Highlights 6 hours, 30 minutes In person About this event Science & Tech • High Tech PQC migration in practice Many people are already aware that quantum computers are a threat to the cryptography we rely on for digital security.

Many people are already aware that quantum computers threaten the cryptography we rely on for digital security. We need to replace vulnerable cryptography with post-quantum alternatives, but where and how should you start this task in your own organisation? This one-hour breakfast meeting will provide you with a brief introduction to the problem of migrating to post-quantum cryptography (PQC) from a practical point of view.

Paper 2024/173 , University of Tartu , Simula UiB , Simula UiB We prove that the seminal KZG polynomial commitment scheme (PCS) is black-box extractable under a simple falsifiable assumption ARSDH. To create an interactive argument, we construct a compiler that combines a black-box extractable non-interactive PCS and a polynomial IOP (PIOP). The compiler incurs a minor cost per every committed polynomial.