[كتاب][B] Elements of quasigroup theory and applications

V Shcherbacov - 2017‏ - taylorfrancis.com
Understanding Interaction is a book that explores the interaction between people and
technology, in the broader context of the relations between the human made and the natural …

[HTML][HTML] On the forced matching numbers of bipartite graphs

P Adams, M Mahdian, ES Mahmoodian - Discrete Mathematics, 2004‏ - Elsevier
Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is
a subset S of M, such that S is contained in no other perfect matching of G. This notion has …

A Latin square autotopism secret sharing scheme

RJ Stones, M Su, X Liu, G Wang, S Lin - Designs, Codes and …, 2016‏ - Springer
We present a novel secret sharing scheme where the secret is an autotopism (a symmetry)
of a Latin square. Previously proposed secret sharing schemes involving Latin squares have …

Defining sets in vertex colorings of graphs and Latin rectangles

ES Mahmoodian, R Naserasr, M Zaker - Discrete Mathematics, 1997‏ - Elsevier
In a given graph G, a set of vertices S with an assignment of colors is said to be a defining
set of the vertex coloring of G, if there exists a unique extension of the colors of S to a χ (G) …

[معلومات الإصدار][C] Latin squares associated to principal autotopisms of long cycles. Application in Cryptography

RM Falcón Ganfornina - Transgressive Computing (2006), p 213-230, 2006‏ - idus.us.es
Fixed a principal isotopism $\Theta=(\alpha,\beta,\epsilon)\in S_n^ 3$, where $ S_n $ is the
symmetric group of the set $ N=\{0, 1,..., n-1\} $, we are going to study in this paper the …

A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares

RM Falcón, V Álvarez, F Gudiel - Advances in Computational Mathematics, 2019‏ - Springer
Latin squares are used as scramblers on symmetric-key algorithms that generate pseudo-
random sequences of the same length. The robustness and effectiveness of these …

Start-up and the results of the volunteer computing project RakeSearch

M Manzyuk, N Nikitina, E Vatutin - … 23–24, 2019, Revised Selected Papers …, 2019‏ - Springer
In this paper we describe the experience of setting up a computational infrastructure based
on BOINC middleware and running a volunteer computing project on its basis. The project is …

Латинские квадраты и их применение в криптографии

МЭ Тужилин - Прикладная дискретная математика, 2012‏ - cyberleninka.ru
В настоящее время в качестве множества M обычно берется множество натуральных
чисел от 1 до n, однако Леонард Эйлер (1707–1783) использовал буквы латинского …

Partitioned private user storages in end-to-end encrypted online social networks

F Schillinger, C Schindelhauer - 2020 15th International …, 2020‏ - ieeexplore.ieee.org
In secure Online Social Networks (OSN), often end-to-end encryption is used to ensure the
privacy of the communication. To manage, store, or transfer cryptographic keys from one …

[PS][PS] Bibliography on secret sharing schemes

DR Stinson, R Wei - 1998‏ - cacr.uwaterloo.ca
In the late 1980's, Gus Simmons compiled a bibliography of papers on secret sharing
schemes. As far as we know, the most recent version of his bibliography was published in …