Related papers: Attacking ApSimon's Mints
Notes on the Spinpossible puzzle game. We give a mathematical description of the game, prove some elementary bounds on the length of optimal solutions, and consider variations of the game which place restrictions on the set of permitted…
Ciphers are a powerful tool for encrypting communication. There are many different cipher types, which makes it computationally expensive to solve a cipher using brute force. In this paper, we frame the decryption task as a classification…
Every day, internet thieves employ new ways to obtain personal identity people and get access to their personal information. Phishing is a somehow complex method that has recently been considered by internet thieves.The present study aims…
We consider a somehow peculiar Token/Bucket problem which at first sight looks confusing and difficult to solve. The winning approach to solve the problem consists in going back to the simple and traditional methods to solve computer…
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of…
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
In this piece, we examine one variant of the infamous 15 Tile Puzzle and develop a mathematical backing behind why it is unsolvable. Using concepts of permutations, bijectivity, and cycle transpositions, we not only prove how to model this…
We discuss a problem initially thought for the Mathematical Olympiad but which has several interpretations. The recurrence sequences involved in this problem may be generalized to recurrence sequences related to a much larger set of…
Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n^2) in the magnitude of the largest denomination.
We define a variant of the two-dimensional Silver Dollar game. Two coins are placed on a chessboard of unbounded size, and two players take turns choosing one of the coins and moving it. Coins are to be moved to the left or upward…
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ourselves to classical communication, this task requires…
In a basic related-key attack against a block cipher, the adversary has access to encryptions under keys that differ from the target key by bit-flips. In this short note we show that for a quantum adversary such attacks are quite powerful:…
This Ph.D. thesis concerns the version of the classical coupon collector's problem, when a collector samples with replacement a set of $n\ge 2$ distinct coupons so that at each time any one of the $n$ coupons is drawn with the same…
The Diophantine Equation Hard Problem (DEHP) is a potential cryptographic problem on the Diophantine equation $U=\sum \limits_{i=1}^n {V_i x_{i}}$. A proper implementation of DEHP would render an attacker to search for private parameters…
We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…
In this paper we discuss the Hidden Subgroup Problem (HSP) in relation to post-quantum group-based cryptography. We review the relationship between HSP and other computational problems discuss an optimal solution method, and review the…
In this paper we investigate the problem of sorting a set of $n$ coins, each with distinct but unknown weights, using an unusual scale. The classical version of this problem, which has been well-studied, gives the user a binary scale,…
We consider Flipping Coins, a partizan version of the impartial game Turning Turtles, played on lines of coins. We show the values of this game are numbers, and these are found by first applying a reduction, then decomposing the position…
The dark matter puzzle is one of the most important open problems in modern physics. The ultra-light axion is a well-motivated dark matter candidate, conceived to resolve the strong-CP problem of quantum chromodynamics. Numerous precision…
We show that a secure quantum protocol for coin tossing exist. The existence of quantum coin tossing support the conjecture of D.Mayers [Phys.Rev.Lett. 78, 3414(1997)] that only asymmetrical tasks as quantum bit commitment are impossible.