• 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 ...
    • Coset leaders of the first order Reed-Muller codes in the classes of Niho functions and Thershold functions 

      Carlet, Claude Michael; Feukoua, Serge; Sălăgean, Ana (Journal article; Peer reviewed, 2024)
      The notion of coset leader has applications in coding theory and cryptography. It has been studied in several papers. In this paper, we extend a recent study, made on the coset leaders of the first order Reed-Muller codes, ...
    • 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 ...
    • Image Reconstruction for Proton Therapy Range Verification via U-NETs 

      Setterdahl, Lena Marie; Lionheart, William R. B.; Holman, Sean F.; Skjerdal, Kyrre; Ratliff, Hunter Nathaniel; Ytre-Hauge, Kristian Smeland; Lathouwers, Danny; Meric, Ilker (Journal article; Peer reviewed, 2024)
      This study aims to investigate the capability of U-Nets in improving image reconstruction accuracy for proton range verification within the framework of the NOVO (Next generation imaging for real-time dose verification ...
    • 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 ...
    • Numerical Method for 3D Quantification of Glenoid Bone Loss 

      Malyshev, Alexander; Noreika, Algirdas (Journal article; Peer reviewed, 2023)
      Let a three-dimensional ball intersect a three-dimensional polyhedron given by its triangulated boundary with outward unit normals. We propose a numerical method for approximate computation of the intersection volume by ...
    • 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 ...
    • On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves 

      Emmanuel, Sam; Fellows, Michael Ralph; Rosamond, Frances; Golovach, Petr (Journal article; Peer reviewed, 2023)
      A lineal topology T = (G, r, T ) of a graph G is an r-rooted depth-first spanning (DFS) tree T of G. Equivalently, this is a spanning tree of G such that every edge uv of G is either an edge of T or is between a vertex u ...
    • Parameterized Complexity of Broadcasting in Graphs 

      Fomin, Fedor; Pierre, Fraigniaud; Golovach, Petr (Journal article; Peer reviewed, 2023)
      The task of the broadcast problem is, given a graph G and a source vertex s, to compute the minimum number of rounds required to disseminate a piece of information from s to all vertices in the graph. It is assumed that, ...
    • 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 ...
    • Runtime Enforcement Using Knowledge Bases 

      Kamburjan, Eduard; Din, Crystal Chang (Journal article; Peer reviewed, 2023)
      Knowledge bases have been extensively used to represent and reason about static domain knowledge. In this work, we show how to enforce domain knowledge about dynamic processes to guide executions at runtime. To do so, we ...
    • 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. ...