Enumeration of Isotopy Classes of Diagonal Latin Squares of Small Order Using Volunteer Computing

AbstractIn this research, the study concerns around several features of diagonal Latin squares (DLSs) of small order. Authors of the study suggest an algorithm for computing minimal and maximal numbers of transversals of DLSs. According to this algorithm, all DLSs of a particular order are generated, and for each square all its transversals and diagonal transversals are constructed. The algorithm was implemented and applied to DLSs of order at most 7 on a personal computer. The experiment for order 8 was performed in the volunteer computing project Gerasim@home. In addition, the problem of finding pairs of orthogonal DLSs of order 10 was considered and reduced to Boolean satisfiability problem. The obtained problem turned out to be very hard, therefore it was decomposed into a family of subproblems. In order to solve the problem, the volunteer computing project SAT@home was used. As a result, several dozen pairs of described kind were found.

Download Full-text

The Search For Pairs Of Orthogonal Diagonal Latin Squares Of Order 10 In The Volunteer Computing Project SAT@home

Bulletin of the South Ural State University Series Computational Mathematics and Software Engineering ◽

10.14529/cmse150308 ◽

2015 ◽

Vol 4 (3) ◽

Keyword(s):

Latin Squares ◽

Volunteer Computing

Download Full-text

A Discussion of a Cryptographical Scheme Based in F-Critical Sets of a Latin Square

Mathematics ◽

10.3390/math9030285 ◽

2021 ◽

Vol 9 (3) ◽

pp. 285

Author(s):

Laura M. Johnson ◽

Stephanie Perkins

Keyword(s):

Necessary Conditions ◽

Latin Square ◽

Latin Squares ◽

Critical Sets ◽

Long Cycles ◽

The Given

This communication provides a discussion of a scheme originally proposed by Falcón in a paper entitled “Latin squares associated to principal autotopisms of long cycles. Applications in cryptography”. Falcón outlines the protocol for a cryptographical scheme that uses the F-critical sets associated with a particular Latin square to generate access levels for participants of the scheme. Accompanying the scheme is an example, which applies the protocol to a particular Latin square of order six. Exploration of the example itself, revealed some interesting observations about both the structure of the Latin square itself and the autotopisms associated with the Latin square. These observations give rise to necessary conditions for the generation of the F-critical sets associated with certain autotopisms of the given Latin square. The communication culminates with a table which outlines the various access levels for the given Latin square in accordance with the scheme detailed by Falcón.

Download Full-text

Further results on large sets of partitioned incomplete Latin squares

Journal of Combinatorial Designs ◽

10.1002/jcd.21772 ◽

2021 ◽

Author(s):

Cong Shen ◽

Dongliang Li ◽

Haitao Cao

Keyword(s):

Latin Squares ◽

Large Sets

Download Full-text

Latin squares from multiplication tables

Journal of Combinatorial Designs ◽

10.1002/jcd.21769 ◽

2021 ◽

Author(s):

Michał Dębski ◽

Jarosław Grytczuk

Keyword(s):

Latin Squares ◽

Multiplication Tables

Download Full-text

Dynamic Scheduling Algorithm in Cyber Mimic Defense Architecture of Volunteer Computing

ACM Transactions on Internet Technology ◽

10.1145/3408291 ◽

2021 ◽

Vol 21 (3) ◽

pp. 1-33

Author(s):

Qianmu Li ◽

Shunmei Meng ◽

Xiaonan Sang ◽

Hanrui Zhang ◽

Shoujin Wang ◽

...

Keyword(s):

Dynamic Scheduling ◽

Scheduling Algorithm ◽

Dynamic Change ◽

High Energy ◽

Transformation Rule ◽

Volunteer Computing ◽

Attack Behavior ◽

Time Threshold ◽

Security And Reliability ◽

Multi Level

Volunteer computing uses computers volunteered by the general public to do distributed scientific computing. Volunteer computing is being used in high-energy physics, molecular biology, medicine, astrophysics, climate study, and other areas. These projects have attained unprecedented computing power. However, with the development of information technology, the traditional defense system cannot deal with the unknown security problems of volunteer computing . At the same time, Cyber Mimic Defense (CMD) can defend the unknown attack behavior through its three characteristics: dynamic, heterogeneous, and redundant. As an important part of the CMD, the dynamic scheduling algorithm realizes the dynamic change of the service centralized executor, which can enusre the security and reliability of CMD of volunteer computing . Aiming at the problems of passive scheduling and large scheduling granularity existing in the existing scheduling algorithms, this article first proposes a scheduling algorithm based on time threshold and task threshold and realizes the dynamic randomness of mimic defense from two different dimensions; finally, combining time threshold and random threshold, a dynamic scheduling algorithm based on multi-level queue is proposed. The experiment shows that the dynamic scheduling algorithm based on multi-level queue can take both security and reliability into account, has better dynamic heterogeneous redundancy characteristics, and can effectively prevent the transformation rule of heterogeneous executors from being mastered by attackers.

Download Full-text

An Incentive-based Mechanism for Volunteer Computing Using Blockchain

ACM Transactions on Internet Technology ◽

10.1145/3419104 ◽

2021 ◽

Vol 21 (4) ◽

pp. 1-22

Author(s):

Ismaeel Al Ridhawi ◽

Moayad Aloqaily ◽

Yaser Jararweh

Keyword(s):

Resource Sharing ◽

Secure Communication ◽

Service Providers ◽

Volunteer Computing ◽

Resource Usage ◽

Content Filtering ◽

Computing Device ◽

Blockchain Technology ◽

Smart Agriculture ◽

Industrial Solutions

The rise of fast communication media both at the core and at the edge has resulted in unprecedented numbers of sophisticated and intelligent wireless IoT devices. Tactile Internet has enabled the interaction between humans and machines within their environment to achieve revolutionized solutions both on the move and in real-time. Many applications such as intelligent autonomous self-driving, smart agriculture and industrial solutions, and self-learning multimedia content filtering and sharing have become attainable through cooperative, distributed, and decentralized systems, namely, volunteer computing. This article introduces a blockchain-enabled resource sharing and service composition solution through volunteer computing. Device resource, computing, and intelligence capabilities are advertised in the environment to be made discoverable and available for sharing with the aid of blockchain technology. Incentives in the form of on-demand service availability are given to resource and service providers to ensure fair and balanced cooperative resource usage. Blockchains are formed whenever a service request is initiated with the aid of fog and mobile edge computing (MEC) devices to ensure secure communication and service delivery for the participants. Using both volunteer computing techniques and tactile internet architectures, we devise a fast and reliable service provisioning framework that relies on a reinforcement learning technique. Simulation results show that the proposed solution can achieve high reward distribution, increased number of blockchain formations, reduced delays, and balanced resource usage among participants, under the premise of high IoT device availability.

Download Full-text