相关论文: The Cubic Public-Key Transformation
Public-key cryptography algorithms have evolved towards increasing computational complexity to hide desired messages, which is accelerating with the development of the Internet and quantum computing. This paper introduces a novel public-key…
We present a deterministic algorithm that, given a prime $p$ and a solution $x \in \mathbb Z$ to the discrete logarithm problem $a^x \equiv b \pmod p$ with $p\nmid a$, efficiently lifts it to a solution modulo $p^k$, i.e., $a^x \equiv b…
The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…
Quadratic Unconstrained Binary Optimization (QUBO) is a general-purpose modeling framework for combinatorial optimization problems and is a requirement for quantum annealers. This paper utilizes the eigenvalue decomposition of the…
A conjecture connected with quantum physics led N. Katz to discover some amazing mixed character sum identities over a field of $q$ elements, where $q$ is a power of a prime $p>3$. His proof required deep algebro-geometric techniques, and…
Secret sharing schemes based on the idea of hidden multipliers in encryption are proposed. As a platform, one can use both multiplicative groups of finite fields and groups of invertible elements of commutative rings, in particular,…
We classify special self-birational transformations of the smooth quadric threefold and fourfold, $Q^3$ and $Q^4$. It turns out that there is only one such example in each dimension. In the case of $Q^3$, it is given by the linear system of…
Integral transformations are useful mathematical tool to work out signals and wave-packets in electronic devices. They may be used in software protocols. Necessary knowledge may come from quantum field theory, in particular from quantum…
In all existing protocols of private communication with encryption and decryption, the pre-shared key can be used for only one time. We give a deterministic quantum key expansion protocol where the pre-shared key can be recycled. Our…
In recent papers of the author, a method was developed for constructing quasitriangular Hopf algebras (quantum groups) of the quantum-double type. As a by-product, a novel non-standard example of the quantum double has been found. In the…
Transformers have gained popularity in machine learning due to their application in the field of natural language processing. They manipulate and process text efficiently, capturing long-range dependencies among data and performing the next…
By resorting to basic features of topological knot theory we propose a (classical) cryptographic protocol based on the `difficulty' of decomposing complex knots generated as connected sums of prime knots and their mutants. The scheme…
The Box-Muller transform is a widely used method to generate Gaussian samples from uniform samples. Quantum amplitude encoding methods encode the multi-variate normal distribution in the amplitudes of a quantum state. This work presents the…
Let $\Bbb Z$ be the set of integers, and let $(m,n)$ be the greatest common divisor of integers $m$ and $n$. Let $p\equiv 1\mod 4$ be a prime, $q\in\Bbb Z$, $2\nmid q$ and $p=c^2+d^2=x^2+qy^2$ with $c,d,x,y\in\Bbb Z$ and $c\e 1\mod 4$.…
This paper examines with elementary proofs some interesting properties of numbers in the binary quadratic form $a^2+ab+b^2$, where $a$ and $b$ are non-negative integers. Key findings of this paper are (i) a prime number $p$ can be…
Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…
In various provers and deductive verification tools, logical transformations are used extensively in order to reduce a proof task into a number of simpler tasks. Logical transformations are often part of the trusted base of such tools. In…
The encoding of quantum information in photonic time-bin qubits is apt for long distance quantum communication schemes. In practice, due to technical constraints such as detector response time, or the speed with which co-polarized time-bins…
Nagell proved that for each prime $p\equiv 1\pmod{3}$, $p > 7$, there is a prime $q<2p^{1/2}$ that is a cubic residue modulo $p$. Here we show that for each fixed $\epsilon > 0$, and each prime $p\equiv 1\pmod{3}$ with $p > p_0(\epsilon)$,…
As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is…