Browsing Department of Informatics by Title
Now showing items 479498 of 773

On the behavior of some APN permutations under swapping points
(Journal article; Peer reviewed, 2022)We define the pAPNspectrum (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
(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 SelfDual Additive Codes over GF(9)
(Peer reviewed; Journal article, 201208)Additive codes over GF(9) that are selfdual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum errorcorrecting codes. ... 
On the Complexity of Intersection Nonemptiness for StarFree Language Classes
(Journal article; Peer reviewed, 2021)In the Intersection Nonemptiness 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
(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
(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 EAclasses of known APN functions in small dimensions
(Journal article; Peer reviewed, 2020)Recently Budaghyan et al. (Cryptogr. Commun. 12, 85–100, 2020) introduced a procedure for investigating if CCZequivalence can be more general than EAequivalence together with inverse transformation (when applicable). In ... 
On the effectiveness of the incremental approach to minimal chordal edge modification
(Journal article; Peer reviewed, 2021)Because edge modification problems are computationally difficult for most target graph classes, considerable attention has been devoted to inclusionminimal edge modifications, which are usually polynomialtime computable ... 
On the feasibility of distributed systems for interactive visual analysis of omics data
(Master thesis, 20140602)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 JExpress Modularized application can be ... 
On the INDCCA1 Security of FHE Schemes
(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 Hfree strong components
(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 HSCC Deletion ... 
On the Parameterized Complexity of the Expected Coverage Problem
(Journal article; Peer reviewed, 2022)The MAXIMUM COVERING LOCATION PROBLEM (MCLP) is a wellstudied 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
(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 privacypreserving ownership ... 
On the Security of NonLinear HB (NLHB) Protocol Against Passive Attack
(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 NonLinear HB(NLHB) protocol. In contrast to HB, ... 
On the Sombor characteristic polynomial and Sombor energy of a graph
(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 HGraphs
(Journal article; Peer reviewed, 2020)For a graph H, a graph G is an Hgraph if it is an intersection graph of connected subgraphs of some subdivision of H. Hgraphs naturally generalize several important graph classes like interval graphs or circulararc ... 
On width measures and topological problems on semicomplete digraphs
(Peer reviewed; Journal article, 2019)The topological theory for semicomplete 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 nextgeneration sequencing for germline and somatic variants
(Journal article; Peer reviewed, 2020)Nextgeneration 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
(Peer reviewed; Journal article, 20100511)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
(Peer reviewed; Journal article, 20110412)We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlledZ gates, and (b) the minimum preparation depth. We assume only onequbit and controlledZ gates. The method exploits the ...