• On Perturbation Resilience of Non-uniform k-Center 

      Bandyapadhyay, Sayan (Journal article; Peer reviewed, 2021)
      The Non-Uniform k-center (NUkC) problem has recently been formulated by Chakrabarty et al. [ICALP, 2016; ACM Trans Algorithms 16(4):46:1–46:19, 2020] as a generalization of the classical k-center clustering problem. In ...
    • On properties of bent and almost perfect nonlinear functions 

      Davidova, Diana (Doctoral thesis, 2021-09-14)
      (Vectorial) Boolean functions play an important role in all domains related to computer science, and in particular, in cryptography. The safety of a cryptosystem is quantified via some characteristics of (vectorial) Boolean ...
    • On properties of translation groups in the affine general linear group with applications to cryptography 

      Calderini, Marco; Civino, Roberto; Sala, Massimiliano (Journal article; Peer reviewed, 2021)
      The affine general linear group acting on a vector space over a prime field is a well-understood mathematical object. Its elementary abelian regular subgroups have recently drawn attention in applied mathematics thanks to ...
    • On relations between CCZ- and EA-equivalences 

      Villa, Irene; Calderini, Marco; Budaghyan, Lilya (Peer reviewed; Journal article, 2020)
      In the present paper we introduce some sufficient conditions and a procedure for checking whether, for a given function, CCZ-equivalence is more general than EA-equivalence together with taking inverses of permutations. ...
    • On Self-Dual Quantum Codes, Graphs, and Boolean Functions 

      Danielsen, Lars Eirik (Master thesis, 2005)
      A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing ...
    • On shared use of renewable stocks 

      Ekerhovd, Nils-Arne; Flåm, Sjur Didrik; Steinshamn, Stein Ivar (Journal article; Peer reviewed, 2020)
      Considered here is multi-party exploitation of common property, renewable resources. The parties play various dynamic games differing in degree of cooperation and commitment. Comparisons of steady states clarify issues on ...
    • On Stable Marriages and Greedy Matchings 

      Manne, Fredrik; Naim, Md.; Lerring, Håkon; Halappanavar, Mahantesh (Conference object; Peer reviewed, 2016)
      Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. We consider ...
    • On Supergraphs Satisfying CMSO Properties 

      Oliveira, Mateus De Oliveira (Journal article; Peer reviewed, 2021)
      Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function f, there is an algorithm A that takes as input a CMSO sentence φ, a positive integer t, and ...
    • On the Asymptotics of Solving the LWE Problem Using Coded-BKW With Sieving. 

      Guo, Qian; Johansson, Thomas; Mårtensson, Erik; Wagner, Paul Stankovski (Peer reviewed; Journal article, 2019)
    • On the behavior of some APN permutations under swapping points 

      Budaghyan, Lilya; Kaleyski, Nikolay Stoyanov; Riera, Constanza Susana; Stanica, Pantelimon (Journal article; Peer reviewed, 2022)
      We define the pAPN-spectrum (which is a measure of how close a function is to being APN) of an (n, n)-function F and investigate how its size changes when two of the outputs of a given function F are swapped. We completely ...
    • On the Boomerang Uniformity of some Permutation Polynomials 

      Calderini, Marco; Villa, Irene (Journal article; Peer reviewed, 2020)
      The boomerang attack, introduced by Wagner in 1999, is a cryptanalysis technique against block ciphers based on differential cryptanalysis. In particular it takes into consideration two differentials, one for the upper ...
    • On the Classification of Hermitian Self-Dual Additive Codes over GF(9) 

      Danielsen, Lars Eirik (Peer reviewed; Journal article, 2012-08)
      Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. ...
    • On the Complexity of Intersection Non-emptiness for Star-Free Language Classes 

      Arrighi, Emmanuel Jean Paul Pierre; Fernau, Henning; Hoffmann, Stefan; Holzer, Markus; Jecker, Ismaël; Oliveira, Mateus De Oliveira; Wolf, Petra (Journal article; Peer reviewed, 2021)
      In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the ...
    • On the Complexity of Recovering Incidence Matrices 

      Fomin, Fedor; Golovach, Petr; Misra, Pranabendu; Ramanujan, M.S. (Journal article; Peer reviewed, 2020)
      The incidence matrix of a graph is a fundamental object naturally appearing in many applications, involving graphs such as social networks, communication networks, or transportation networks. Often, the data collected about ...
    • On the Distance Between APN Functions 

      Budaghyan, Lilya; Carlet, Claude; Helleseth, Tor; Kaleyski, Nikolay Stoyanov (Journal article; Peer reviewed, 2020)
      We investigate the differential properties of a vectorial Boolean function G obtained by modifying an APN function F . This generalizes previous constructions where a function is modified at a few points. We characterize ...
    • On the EA-classes of known APN functions in small dimensions 

      Calderini, Marco (Journal article; Peer reviewed, 2020)
      Recently Budaghyan et al. (Cryptogr. Commun. 12, 85–100, 2020) introduced a procedure for investigating if CCZ-equivalence can be more general than EA-equivalence together with inverse transformation (when applicable). In ...
    • On the effectiveness of the incremental approach to minimal chordal edge modification 

      Blair, Jean; Crespelle, Christophe Dominique (Journal article; Peer reviewed, 2021)
      Because edge modification problems are computationally difficult for most target graph classes, considerable attention has been devoted to inclusion-minimal edge modifications, which are usually polynomial-time computable ...
    • On the feasibility of distributed systems for interactive visual analysis of omics data 

      Farag, Yehia Mohamed (Master thesis, 2014-06-02)
      The purpose of this thesis is to discuss the feasibility of developing a distributed interactive visual analysis omics system demonstrating how selected modules from the standalone J-Express Modularized application can be ...
    • On the IND-CCA1 Security of FHE Schemes 

      Hovd, Martha Norberg; Fauzi, Prastudy; Raddum, Håvard (Journal article; Peer reviewed, 2022)
      Fully homomorphic encryption (FHE) is a powerful tool in cryptography that allows one to perform arbitrary computations on encrypted material without having to decrypt it first. There are numerous FHE schemes, all of which ...
    • On the parameterized complexity of deletion to H-free strong components 

      Neogi, Rian; Ramanujan, M.S.; Saurabh, Saket; Sharma, Roohani (Journal article; Peer reviewed, 2020)
      Directed Feedback Vertex Set (DFVS) is a fundamental computational problem that has received extensive attention in parameterized complexity. In this paper, we initiate the study of a wide generalization, the H-SCC Deletion ...