Related papers: Modifying twist algorithms for determining the key…
Temporal Key Integrity Protocol (TKIP) is the IEEE TaskGroupi solution for the security loop holes present in the already widely deployed 802.11 hardware. It is a set of algorithms that wrap WEP to give the best possible solution given…
Given a graph G, the {\em maximum internal spanning tree problem} (MIST for short) asks for computing a spanning tree T of G such that the number of internal vertices in T is maximized. MIST has possible applications in the design of…
Several cryptographic protocols constructed based on less-known algorithmic problems, such as those in non-commutative groups, group rings, semigroups, etc., which claim quantum security, have been broken through classical reduction methods…
We formally study iterated block ciphers that alternate between two sequences of independent and identically distributed (i.i.d.) rounds. It is demonstrated that, in some cases the effect of alternating increases security, while in other…
A new Chase-type soft-decision decoding algorithm for Reed-Solomon codes is proposed, referred to as tree-based Chase-type algorithm}. The proposed tree-based Chase-type algorithm takes the set of all vectors as the set of testing patterns,…
We study three-dimensional ${\mathcal N}=2$ supersymmetric gauge theories on ${\Sigma_g \times S^1}$ with a topological twist along $\Sigma_g$, a genus-$g$ Riemann surface. The twisted supersymmetric index at genus $g$ and the correlation…
We provide a systematic approach to twisting differential KO-theory leading to a construction of the corresponding twisted differential Atiyah-Hirzebruch spectral sequence (AHSS). We relate and contrast the degree two and the degree one…
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 provide a security analysis for continuous variable quantum key distribution protocols based on the transmission of squeezed vacuum states measured via homodyne detection. We employ a version of the entropic uncertainty relation for…
Security analysis is a critical part in any cryptographic protocol, may it be classical or quantum. Without security analysis, one cannot ensure the secrecy of the distributed keys. To perform a conclusive security analysis, it is very…
A twist property is developed which imparts certain properties on the twisted group algebra. These include an involution * satisfying (xy)*=y*x* and an inner product satisfying <xy,z> = <x,zy*> and <xy,z>=<y,x*z>. Examples of twisted group…
Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry…
We observed few important facts that concerns with the new proposal of knapsack cipher 0/255, recently published by Pham [1]. The author claimed that the time complexity for solving new improved trapdoor knapsack is O(256^N). In this paper,…
The ribbonlength Rib$(K)$ of a knot $K$ is the infimum of the ratio of the length of any flat knotted ribbon with core $K$ to its width. A twisted torus knot $T_{p,q;r,s}$ is obtained from the torus knot $T_{p,q}$ by twisting $r$ adjacent…
In this paper we solve an open question formulated in the original paper of twisted skew group codes regarding when a twisted skew group code is checkable. Also, we prove that all ideals of dimension 3 over a twisted group algebra are…
We revisit the relations between open and closed string scattering amplitudes discovered by Kawai, Lewellen, and Tye (KLT). We show that they emerge from the underlying algebro-topological identities known as the twisted period relations.…
This paper is dedicated to the late Professor H.P. Yuen in commemoration to our 50-year friendship. He invented the concept of quantum stream cipher. It is designed based on a completely different concept from conventional ciphers. The…
This paper describes a linear-time algorithm that finds the longest stretch in a sequence of real numbers (``scores'') in which the sum exceeds an input parameter. The algorithm also solves the problem of finding the longest interval in…
We introduce the hook length expansion technique and explain how to discover old and new hook length formulas for partitions and plane trees. The new hook length formulas for trees obtained by our method can be proved rather easily, whereas…
Given the vast reservoirs of data stored worldwide, efficient mining of data from a large information store has emerged as a great challenge. Many databases like that of intrusion detection systems, web-click records, player statistics,…