Now showing items 479-498 of 773

    • 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 ...
    • On the Parameterized Complexity of the Expected Coverage Problem 

      Fomin, Fedor; Ramamoorthi, Vijayaragunathan (Journal article; Peer reviewed, 2022)
      The MAXIMUM COVERING LOCATION PROBLEM (MCLP) is a well-studied problem in the field of operations research. Given a network with positive or negative demands on the nodes, a positive integer k, the MCLP seeks to find k ...
    • On the Privacy of Two Tag Ownership Transfer Protocols for RFIDs 

      Abyaneh, Mohammad Reza Sohizadeh (Conference object, 2012)
      In this paper, the privacy of two recent RFID tag ownership transfer protocols are investigated against the tag owners as adversaries. The first protocol called ROTIV is a scheme which provides a privacy-preserving ownership ...
    • On the Security of Non-Linear HB (NLHB) Protocol Against Passive Attack 

      Abyaneh, Mohammad Reza Sohizadeh (Conference object, 2012)
      As a variant of the HB authentication protocol for RFID systems, which relies on the complexity of decoding linear codes against passive attacks, Madhavan et al. presented Non-Linear HB(NLHB) protocol. In contrast to HB, ...
    • On the Sombor characteristic polynomial and Sombor energy of a graph 

      Ghanbari, Nima (Journal article; Peer reviewed, 2022)
      Let G be a simple graph with vertex set V(G)={v1,v2,…,vn}. The Sombor matrix of G, denoted by ASO(G), is defined as the n×n matrix whose (i, j)-entry is d2i+d2j−−−−−−√ if vi and vj are adjacent and 0 for another cases. Let ...
    • On the Tractability of Optimization Problems on H-Graphs 

      Fomin, Fedor; Golovach, Petr; Raymond, Jean-Florent (Journal article; Peer reviewed, 2020)
      For a graph H, a graph G is an H-graph if it is an intersection graph of connected subgraphs of some subdivision of H. H-graphs naturally generalize several important graph classes like interval graphs or circular-arc ...
    • On width measures and topological problems on semi-complete digraphs 

      Fomin, Fedor; Pilipczuk, Michal (Peer reviewed; Journal article, 2019)
      The topological theory for semi-complete digraphs, pioneered by Chudnovsky, Fradkin, Kim, Scott, and Seymour [10], [11], [12], [28], [43], [39], concentrates on the interplay between the most important width measures — ...
    • One byte at a time: evidencing the quality of clinical service next-generation sequencing for germline and somatic variants 

      Gutowska-Ding, Maria Weronika; Deans, Zandra C.; Roos, Christophe; Matilainen, Jukka; Khawaja, Farrah; Brügger, Kim; Ahn, Jo Wook; Boustred, Christopher; Patton, Simon J. (Journal article; Peer reviewed, 2020)
      Next-generation sequencing (NGS) is replacing other molecular techniques to become the de facto gene diagnostics approach, transforming the speed of diagnosis for patients and expanding opportunities for precision medicine. ...
    • The Ontology Lookup Service: bigger and better 

      Côté, Richard G.; Reisinger, Florian; Martens, Lennart; Barsnes, Harald; Vizcaíno, Juan Antonio; Hermjakob, Henning (Peer reviewed; Journal article, 2010-05-11)
      The Ontology Lookup Service (OLS; http://www.ebi .ac.uk/ols) has been providing several means to query, browse and navigate biomedical ontologies and controlled vocabularies since it first went into production 4 years ago, ...
    • Optimal preparation of graph states 

      Cabello, Adán; Danielsen, Lars Eirik; López-Tarrida, Antonio J.; Portillo, José R. (Peer reviewed; Journal article, 2011-04-12)
      We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the ...