Quantum computing is threatening current cryptography, especially the asymmetric algorithms used in many Internet protocols. More secure algorithms, colloquially referred to as Post-Quantum Cryptography (PQC), are under active development. These new algorithms differ significantly from current ones. They can have larger signatures or keys, and often require more computational power. This means we cannot just replace existing algorithms by PQC alternatives, but need to evaluate if they meet the requirements of the Internet protocols that rely on them. In this paper we provide a case study, analyzing the impact of PQC on the Domain Name System (DNS) and its Security Extensions (DNSSEC). In its main role, DNS translates human-readable domain names to IP addresses and DNSSEC guarantees message integrity and authenticity. DNSSEC is particularly challenging to transition to PQC, since DNSSEC and its underlying transport protocols require small signatures and keys and efficient validation. We evaluate current candidate PQC signature algorithms in the third round of the NIST competition on their suitability for use in DNSSEC. We show that three algorithms, partially, meet DNSSEC's requirements but also show where and how we would still need to adapt DNSSEC. Thus, our research lays the foundation for making DNSSEC, and protocols with similar constraints ready for PQC.

Correlation functions in a dynamic quartic matrix model are obtained from the twopoint function through a recurrence relation. This paper gives the explicit solution of the recurrence by mapping it bijectively to a two-fold nested combinatorial structure each counted by Catalan numbers. These "nested Catalan tables" have a description as diagrams of non-crossing chords and threads.

The remarkable properties of the real scalar quartic quantum field theory on the Moyal plane in combination with its similarity to the Kontsevich model make the model's partition function an interesting object to study. However, direct evaluations is obstructed by the intertwining of the field's various modes. A factorization procedure to circumvent this problem is proposed and discussed here in the context of the real scalar quartic qft on the Moyal plane. This factorization consists of integrating against the asymptotic volume of the diagonal subpolytope of symmetric stochastic matrices. This volume has been determined to this end. Using this method the partition function for regime of weak coupling is computed. Using the same method it is as well possible to determine the partition function and free energy density for other regimes.

We present a differentially private extension of the block coordinate descent algorithm by means of objective perturbation. The algorithm iteratively performs linear regression in a federated setting on vertically partitioned data. In addition to a privacy guarantee, we derive a utility guarantee; a tolerance parameter indicates how much the differentially private regression may deviate from the analysis without differential privacy. The algorithm’s performance is compared with that of the standard block coordinate descent algorithm on both artificial test data and real-world data. We find that the algorithm is fast and able to generate practical predictions with single-digit privacy budgets, albeit with some accuracy loss.