Related papers: Why the same key can open different padlocks?
A conventional computer keyboard consists of as many as 101 keys. The keyboard has several sections, such as text entry section, navigation section, and numeric keypad etc. and each having several keys on the keyboard. The size of the…
In this paper, we propose new classes of trapdoor functions to solve the closest vector problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the closest vector problem is hard to solve unless…
The lock is a building-block synchronization primitive that enables mutually exclusive access to shared data in shared-memory parallel programs. Mutual exclusion is typically achieved by guarding the code that accesses the shared data with…
The evaluation of logic locking methods has long been predicated on an implicit assumption that only the correct key can unveil the true functionality of a protected circuit. Consequently, a locking technique is deemed secure if it resists…
Natural materials often feature a combination of soft and stiff phases, arranged to achieve excellent mechanical properties, such as high strength and toughness. Many natural materials have even independently evolved to have similar…
After a discussion of the definition and number of pseudoknots, we reconsider the self-attracting homopolymer paying particular attention to the scaling of the number of pseudoknots at different temperature regimes in two and three…
We present an efficient lock-free algorithm for parallel accessible hash tables with open addressing, which promises more robust performance and reliability than conventional lock-based implementations. ``Lock-free'' means that it is…
We consider the interaction of two-dimensional colloids, in nematic liquid crystals, with walls or geometrical boundaries. The interactions between colloidal disks and flat walls, with homeotropic boundary conditions, are always repulsive.…
In order to better understand the structure of closed collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice. In this note, we find the maximal closed sets over a finite alphabet.…
This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal…
Logic locking has emerged to prevent piracy and overproduction of integrated circuits ever since the split of the design house and manufacturing foundry was established. While there has been a lot of research using a single global key to…
We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while the latter provides better reliability. We specify the…
In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…
We consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on…
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…
Counting interior-disjoint empty convex polygons in a point set is a typical Erd\H{o}s-Szekeres-type problem. We study this problem for 4-gons. Let $P$ be a set of $n$ points in the plane and in general position. A subset $Q$ of $P$, with…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
In this paper, six constructions of difference families are presented. These constructions make use of difference sets, almost difference sets and disjoint difference families, and give new point of views of relationships among these…
Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…
We establish a hook length bias between self-conjugate partitions and partitions of distinct odd parts, demonstrating that there are more hooks of fixed length $t \geq 2$ among self-conjugate partitions of $n$ than among partitions of…