The invention of smart low-power devices and ubiquitous Internet connectivity have facilitated the shift of many labour-intensive jobs into the digital domain. The shortage of skilled workforce and the growing food demand have led the agriculture sector to adapt to the digital transformation. Smart sensors and systems are used to monitor crops, plants, the environment, water, soil moisture, and diseases. The transformation to digital agriculture would improve the quality and quantity of food for the ever-increasing human population. This paper discusses the security threats and vulnerabilities to digital agriculture, which are overlooked in other published articles. It also provides a comprehensive review of the side-channel attacks (SCA) specific to digital agriculture, which have not been explored previously. The paper also discusses the open research challenges and future directions.

We show that the only Fibonacci numbers that are concatenations of two repdigits are 13, 21, 34, 55, 89, 144, 233, 377.

Secret sharing is one of the most important cryptographic protocols. Secret sharing schemes (SSS) have been created to that end. This protocol requires a dealer and several participants. The dealer divides the secret into several pieces ( the shares), and one share is given to each participant. The secret can be recovered once a subset of the participants (a coalition) shares their information. In this paper, we present a new multisecret-sharing scheme inspired by Blakley’s method based on hyperplanes intersection but adapted to a coding theoretic situation. Unique recovery requires the use of linear complementary (LCD) codes, that is, codes in which intersection with their duals is trivial. For a given code length and dimension, our system allows dealing with larger secrets and more users than other code-based schemes.

There is a special local ring $E$ of order $4,$ without identity for the multiplication, defined by $E=〈a,b|2a=2b=0,a^2=a,b^2=b,ab=a,ba=b〉.$ We study the algebraic structure of linear codes over that non-commutative local ring, in particular their residue and torsion codes. We introduce the notion of quasi self-dual codes over $E,$ and Type IV codes, that is quasi self-dual codes whose all codewords have even Hamming weight. We study the weight enumerators of these codes by means of invariant theory, and classify them in short lengths.