• Attacks on Integer-RLWE 

      Budroni, Alessandro; Chetioui, Benjamin; Franch, Ermes (Journal article; Peer reviewed, 2020)
      In 2019, Gu Chunsheng introduced Integer-RLWE, a variant of RLWE devoid of some of its efficiency flaws. Most notably, he proposes a setting where n can be an arbitrary positive integer, contrarily to the typical construction ...
    • A Bit-Vector Differential Model for the Modular Addition by a Constant 

      Azimi, Seyyed Arash; Ranea, Adrián; Salmasizadeh, Mahmoud; Mohajeri, Javad; Aref, Mohammad Reza; Rijmen, Vincent Stefaan (Journal article; Peer reviewed, 2020)
      ARX algorithms are a class of symmetric-key algorithms constructed by Addition, Rotation, and XOR, which achieve the best software performances in low-end microcontrollers. To evaluate the resistance of an ARX cipher against ...
    • Consistency of Heterogeneously Typed Behavioural Models: A Coalgebraic Approach 

      Wolter, Uwe Egbert; König, Harald (Journal article; Peer reviewed, 2022)
      Systematic and formally underpinned consistency checking of heterogeneously typed interdependent behavioural models requires a common metamodel, into which the involved models can be translated. And, if additional system ...
    • Generalization of a class of APN binomials to Gold-like functions 

      Davidova, Diana; Kaleyski, Nikolay Stoyanov (Journal article; Peer reviewed, 2021)
      In 2008 Budaghyan, Carlet and Leander generalized a known instance of an APN function over the finite field F212 and constructed two new infinite families of APN binomials over the finite field F2n , one for n divisible ...
    • Geometric Planar Networks on Bichromatic Points 

      Bandyapadhyay, Sayan; Banik, Aritra; Bhore, Sujoy; Nollenburg, Martin (Journal article; Peer reviewed, 2020)
      We study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree, and Minimum perfect matching on geometric graphs induced by bichromatic ( Open image in new window and Open image in new ...
    • Guarding the First Order: The Rise of AES Maskings 

      Askeland, Amund; Dhooghe, S.; Petkova-Nikova, Svetla Iordanova; Rijmen, Vincent Stefaan; Zhang, Zhenda (Journal article; Peer reviewed, 2023)
      We provide three first-order hardware maskings of the AES, each allowing for a different trade-off between the number of shares and the number of register stages. All maskings use a generalization of the changing of the ...
    • I Can See Clearly Now: Clairvoyant Assertions for Deadlock Checking 

      Abusdal, Ole Jørgen; Din, Crystal Chang; Pun, Violet Ka I; Stolz, Volker (Journal article; Peer reviewed, 2022)
      Static analysers are traditionally used to check various correctness properties of software. In the face of refactorings that can have adverse effects on correctness, developers need to analyse the code after refactoring ...
    • Making the BKW Algorithm Practical for LWE 

      Budroni, Alessandro; Guo, Qian; Johansson, Thomas; Mårtensson, Erik; Stankovski Wagner, Paul (Journal article; Peer reviewed, 2020)
      The Learning with Errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum-Kalai-Wasserman (BKW) algorithm. This paper ...
    • The mersenne low hamming combination search problem can be reduced to an ILP problem 

      Budroni, Alessandro; Tenti, Andrea (Lecture Notes in Computer Science, Chapter; Peer reviewed; Journal article, 2019)
      In 2017, Aggarwal, Joux, Prakash, and Santha proposed an innovative NTRU-like public-key cryptosystem that was believed to be quantum resistant, based on Mersenne prime numbers q=2N−1 . After a successful attack designed ...
    • A novel CCA attack using decryption errors against LAC 

      Guo, Qian; Johansson, Thomas; Yang, Jing (Peer reviewed; Journal article, 2019)
      Cryptosystems based on Learning with Errors or related problems are central topics in recent cryptographic research. One main witness to this is the NIST Post-Quantum Cryptography Standardization effort. Many submitted ...
    • On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters 

      Høgemo, Svein; Bergougnoux, Benjamin; Brandes, Ulrik; Paul, Christophe; Telle, Jan Arne (Journal article; Peer reviewed, 2021)
      The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist ...
    • The Perfect Matching Cut Problem Revisited 

      Telle, Jan Arne; Le, Van Bang (Journal article; Peer reviewed, 2021)
      In a graph, a perfect matching cut is an edge cut that is a perfect matching. perfect matching cut (pmc) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP -complete. We ...
    • Quantitative Externalization of Visual Data Analysis Results Using Local Regression Models 

      Matkovic, Kresimir; Abraham, Hrvoje; Jelovic, Mario; Hauser, Helwig (Journal article; Peer reviewed, 2017)
      Both interactive visualization and computational analysis methods are useful for data studies and an integration of both approaches is promising to successfully combine the benefits of both methodologies. In interactive ...
    • Sparse Nerves in Practice 

      Blaser, Nello; Brun, Morten (Peer reviewed; Journal article, 2019)
      Topological data analysis combines machine learning with methods from algebraic topology. Persistent homology, a method to characterize topological features occurring in data at multiple scales is of particular interest. ...
    • Synthesis and Analysis of Petri Nets from Causal Specifications 

      De Oliveira Oliveira, Mateus (Journal article; Peer reviewed, 2022)
      Petri nets are one of the most prominent system-level formalisms for the specification of causality in concurrent, distributed, or multi-agent systems. This formalism is abstract enough to be analyzed using theoretical ...
    • Three problems on well-partitioned chordal graphs 

      Ahn, Jungho; Jaffke, Lars; Kwon, O-Joung; Lima, Paloma Thome de (Journal article; Peer reviewed, 2021)
      In this work, we solve three problems on well-partitioned chordal graphs. First, we show that every connected (resp., 2-connected) well-partitioned chordal graph has a vertex that intersects all longest paths (resp., longest ...
    • Twinning-by-Construction: Ensuring Correctness for Self-adaptive Digital Twins 

      Kamburjan, Eduard; Din, Crystal Chang; Schlatte, Rudolf; Tapia Tarifa, Silvia Lizeth; Johnsen, Einar Broch (Journal article; Peer reviewed, 2022)
      Digital twin applications use digital artefacts to twin physical systems. The purpose is to continuously mirror the structure and behavior of the physical system, such that users can analyse the physical system by means ...
    • What Is Known About Vertex Cover Kernelization? 

      Fellows, Michael R.; Jaffke, Lars; Király, Aliz Izabella; Rosamond, Frances; Weller, Mathias (Peer reviewed; Journal article, 2018)
      We are pleased to dedicate this survey on kernelization of the Vertex Cover problem, to Professor Juraj Hromkovič on the occasion of his 60th birthday. The Vertex Cover problem is often referred to as the Drosophila of ...