Zobrazeno 1 - 10
of 231
pro vyhledávání: '"Blackburn Simon R."'
Autor:
Blackburn, Simon R.
Donald A. Preece gave two talks in 2013, in which he introduced the notion of tredoku patterns. These are certain configurations of diamond-shaped tiles, inspired by the sukodu-like puzzle that appears in newspapers. Very sadly, Prof. Preece died in
Externí odkaz:
http://arxiv.org/abs/2407.10752
We define and investigate the property of being `exponent-critical' for a finite group. A finite group is said to be exponent-critical if its exponent is not the least common multiple of the exponents of its proper non-abelian subgroups. We explore p
Externí odkaz:
http://arxiv.org/abs/2401.07834
Let $F_n$ be a free group of rank $n$, with free generating set $X$. A subset $D$ of $F_n$ is a \emph{Distinct Difference Configuration} if the differences $g^{-1}h$ are distinct, where $g$ and $h$ range over all (ordered) pairs of distinct elements
Externí odkaz:
http://arxiv.org/abs/2307.03627
Autor:
Blackburn, Simon R., Etzion, Tuvi
Let $n$, $s$ and $k$ be positive integers. For distinct $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a circle. So \[ ||i,j||_n=\min\{(i-j)\bmod n,(j-i)\bmod n\}. \]
Externí odkaz:
http://arxiv.org/abs/2306.03685
Publikováno v:
Journal of Mathematical Cryptology, Vol 5, Iss 2, Pp 159-168 (2012)
Externí odkaz:
https://doaj.org/article/995fc7d1e1ac4db59a8cc53c7c10661f
Autor:
Blackburn Simon R.
Publikováno v:
Journal of Mathematical Cryptology, Vol 4, Iss 2, Pp 193-198 (2010)
The paper provides a cryptanalysis of the AAβ-cryptosystem recently proposed by Ariffin and Abu. The scheme is in essence a key agreement scheme whose security is based on a discrete logarithm problem in the infinite (additive) group ℝ/ℤ (the re
Externí odkaz:
https://doaj.org/article/83af3e51e20f4905946972a37dae3576
Publikováno v:
Journal of Mathematical Cryptology, Vol 3, Iss 4, Pp 321-338 (2009)
This paper describes a cryptanalysis of MST3, a public key cryptosystem based on nonabelian groups recently proposed by Lempken, Magliveras, van Trung and Wei.
Externí odkaz:
https://doaj.org/article/78cb4cbc680649c68101921957534a67
Autor:
Blackburn Simon R.
Publikováno v:
Journal of Mathematical Cryptology, Vol 3, Iss 3, Pp 199-203 (2009)
Biggs has recently proposed the critical group of a certain class of finite graphs as a platform group for cryptosystems relying on the difficulty of the discrete log problem. The paper uses techniques from the theory of Picard groups on finite graph
Externí odkaz:
https://doaj.org/article/78283c6a52be4776b22ecdbbd72cfcb8
Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes in which overlaps of certain specified sizes are forbidden. We prove s
Externí odkaz:
http://arxiv.org/abs/2211.10309
Autor:
Blackburn, Simon R., Claridge, Jessica
The Additive-Multiplicative Matrix Channel (AMMC) was introduced by Silva, Kschischang and K\"otter in 2010 to model data transmission using random linear network coding. The input and output of the channel are $n\times m$ matrices over a finite fiel
Externí odkaz:
http://arxiv.org/abs/2210.14100