相关论文: Candidate One-Way Functions and One-Way Permutatio…

We study 1-way quantum finite automata (QFAs). First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a large probability (over 0.98), then the power of 1-way QFAs…

The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…

Quantum eigenvalue transformation (QET) and its generalization, quantum singular value transformation (QSVT), are versatile quantum algorithms that allow us to apply broad matrix functions to quantum states, which cover many of significant…

The one way function based on the Collatz problem is proposed. It is based on the problem's conditional branching structure which is not considered as important even the 3x+1 question is quite famous. The analysis shows why the problem is…

It is an important question to find constructions of quantum cryptographic protocols which rely on weaker computational assumptions than classical protocols. Recently, it has been shown that oblivious transfer and multi-party computation…

It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations of fixed…

We present a class of hardware-based cryptographic one-way functions that, in practice, would be hard to invert even if P=NP and linear-time satisfiability algorithms exist. Such functions use a hardware-based component with omega(n^2) size…

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

In this paper, we make use of the classification results of low-degree permutation rational functions together with their geometric properties to investigate rational functions that induce permutations on the multiplicative subgroup mu_q+1,…

This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a square-root - a simple minded…

We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…

A sequence of functions {f_n(q)}_{n=1}^{\infty} satisfies the functional equation for multiplication of quantum integers if f_{mn}(q) = f_m(q)f_n(q^m) for all positive integers m and n. This paper describes the structure of all sequences of…

We survey recent developments in the study of (worst-case) one-way functions having strong algebraic and security properties. According to [RS93], this line of research was initiated in 1984 by Rivest and Sherman who designed two-party…

Permutation polynomials are of particular significance in several areas of applied mathematics, such as Coding theory and Cryptography. Many recent constructions are based on the Akbary-Ghioca-Wang (AGW) criterion. Along this line of…

In 2007, G.E. Andrews introduced the $(n+1)$-variable combinatorial generating function $R_n(x_1,x_2,\cdots,x_n;q)$ for ranks of $n$-marked Durfee symbols, an $(n+1)$-dimensional multisum, as a vast generalization to the ordinary…

We show how representations of finite-dimensional quantum operators can be constructed using nondeterministic rewriting systems. In particular, we investigate Wolfram model multiway rewriting systems based on string substitutions. Multiway…

This paper is about certain string-to-string functions, called the polyregular functions. These are like the regular string-to-string functions, except that they can have polynomial (and not just linear) growth. The class has four…

We use the Poisson kernel of the continuous $q$-Hermite polynomials to introduces families of integral operators, which are semigroups of linear operators. We describe the eigenvalues and eigenfunctions of one family of operators. The…

We define a switch function to be a function from an interval to $\{1,-1\}$ with a finite number of sign changes. (Special cases are the Walsh functions.) By a topological argument, we prove that, given $n$ real-valued functions, $f_1,…

The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…