•A DNA-based color image encryption method is proposed by using three 1D chaotic systems with excellent performance and easy implementation.•The key streams used for encryption are related to both ...the secret keys and the plain-image.•To improve the security and sensitivity, a division-shuffling process is introduced.•Transforming the plain-image and the key streams into the DNA matrices randomly can further enhance the security of the cryptosystem.•The presented scheme has a good robustness for some common image processing operations and geometric attack.
This paper proposes a new encryption scheme for color images based on Deoxyribonucleic acid (DNA) sequence operations and multiple improved one-dimensional (1D) chaotic systems with excellent performance. Firstly, the key streams are generated from three improved 1D chaotic systems by using the secret keys and the plain-image. Transform randomly the key streams and the plain-image into the DNA matrices by the DNA encoding rules, respectively. Secondly, perform the DNA complementary and XOR operations on the DNA matrices to get the scrambled DNA matrices. Thirdly, decompose equally the scrambled DNA matrices into blocks and shuffle these blocks randomly. Finally, implement the DNA XOR and addition operations on the DNA matrices obtained from the previous step and the key streams, and then convert the encrypted DNA matrices into the cipher-image by the DNA decoding rules. Experimental results and security analysis show that the proposed encryption scheme has a good encryption effect and high security. Moreover, it has a strong robustness for the common image processing operations and geometric attack.
Full text
Available for:
GEOZS, IJS, IMTLJ, KILJ, KISLJ, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UL, UM, UPCLJ, UPUK
Based on deoxyribonucleic acid (DNA) coding and two excellent low-dimensional chaotic systems, a new color image cryptosystem is proposed in this paper. The presented image cryptosystem consists of ...four processes: key streams generation process, DNA sequences confusion process, DNA sequences diffusion process and pixel-level diffusion process. In the first stage, two simple improved chaotic systems and the information entropy of the plain-image are together employed to generate the pseudorandom key streams. Then, the original image is converted into the DNA sequence matrices by the DNA encoding rules, and the binary key streams are used to permute the DNA matrices. The third process performs a row and column diffusion processes on the scrambled DNA matrices by the key streams and DNA XOR operation. Finally, the DNA matrices are transformed into the encrypted image via the DNA decoding rules, and a ciphertext diffusion in crisscross pattern is further adopted to strengthen the security and sensitivity of the cryptosystem. Thus, the resulting cipher-image is obtained. Experimental results and security analysis have demonstrated the excellent performance of our proposed algorithm in image encryption.
Full text
Available for:
EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OBVAL, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
3.
New classes of permutation quadrinomials over 𝔽q3 CHEN, Changhui; KAN, Haibin; PENG, Jie ...
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
08/2024, Volume:
E107.A, Issue:
8
Journal Article
Peer reviewed
Open access
Permutation polynomials have been studied for a long time and have important applications in cryptography, coding theory and combinatorial designs. In this paper, by means of the multivariate method ...and the resultant, we propose four new classes of permutation quadrinomials over 𝔽q3, where q is a prime power. We also show that they are not quasi-multiplicative equivalent to known ones. Moreover, we compare their differential uniformity with that of some known classes of permutation trinomials for some small q.
Permutation polynomials have important applications in cryptography, coding theory and combinatorial designs. In this letter, we construct four classes of permutation polynomials over 𝔽2n × 𝔽2n, ...where 𝔽2n is the finite field with 2n elements.
It is known that Boolean functions used in stream and block ciphers should have good cryptographic properties to resist algebraic attacks. Up until now, there have been several constructions of ...Boolean functions achieving optimum algebraic immunity. However, most of their nonlinearities are very low. Carlet and Feng studied a class of Boolean functions with optimum algebraic immunity and deduced the lower bound of its nonlinearity, which is good, but not very high. Moreover, the main practical problem with this construction is that it cannot be implemented efficiently. In this paper, we put forward a new method to construct cryptographically significant Boolean functions by using primitive polynomials, and construct three infinite classes of Boolean functions with good cryptographic properties: balancedness, optimum algebraic degree, optimum algebraic immunity, and a high nonlinearity.
In this paper, by using multi-level two-dimensional (2D) discrete wavelet transform (DWT), singular value decomposition (SVD) and chaotic encryption, a new secure watermarking scheme is proposed for ...embedding the color watermark into the color host image. In order to improve the security of the proposed algorithm, coupled map lattice (CML) is employed to modify the pixel values of the watermark image. For watermark embedding, both the host image and the encrypted watermark are converted into the NTSC color space, and then the multi-level 2D DWT is performed on the host image. The ciphered watermark is embedded by modifying the singular values of the low frequency sub-bands of the host image. Also a reliable extraction algorithm is devised to extract the watermark from the possibly attacked watermarked images without resorting to the original image. Experimental and analysis results demonstrate that the proposed watermarking scheme has not only an excellent imperceptibility but a strong robustness against the common image processing attacks, geometric attacks and some composite attacks. The results also show that our proposed method outperforms the related dual-images watermarking algorithms in most cases.
Full text
Available for:
CEKLJ, EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
Locally repairable codes (LRCs) were proposed to reduce the repair degree in distributed storage systems. In particular, LRCs with availability are highly desirable for distributed storage systems, ...since this kind of codes provide the mechanism of local repair for code symbols and parallel reading of hot data. In this paper, we propose four types of (
n, k, r, t
)
q
LRCs from combinatorial designs. We introduce several constructions of LRCs with strict availability and some constructions of distance-optimal LRCs with information-symbol locality. Most of our constructions in this paper are over
F
2
, i.e., they are suitable for implementation.
Full text
Available for:
EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OBVAL, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
For any positive integers
n
=
2
k
and
m
such that
m
≥
k
,
in this paper we show that the maximal number of bent components of any (
n
,
m
)-function is equal to
2
m
-
2
m
-
k
,
and for those ...attaining the equality, their algebraic degree is at most
k
. It is easily seen that all (
n
,
m
)-functions of the form
G
(
x
)
=
(
F
(
x
)
,
0
)
,
with
F
(
x
) being any vectorial bent (
n
,
k
)-function, have the maximal number of bent components. Those simple functions
G
are called trivial in this paper. We show that for a power (
n
,
n
)-function, it has the maximal number of bent components if and only if it is trivial. We also consider the (
n
,
n
)-function of the form
F
(
x
)
=
x
h
(
Tr
e
n
(
x
)
)
,
where
h
:
F
2
e
→
F
2
e
,
and show that
F
has the maximal number of bent components if and only if
e
=
k
,
and
h
is a permutation over
F
2
e
.
It essentially shows that all previously known nontrivial functions with maximal number of bent components are subclasses of the class described by
F
. Based on the Maiorana–McFarland class, we present constructions of large numbers of (
n
,
m
)-functions with maximal number of bent components for any integer
m
in bivariate representation. We also determine the differential spectra and Walsh spectra of the constructed functions. It turns out that our constructions can also provide new plateaued vectorial functions.
Full text
Available for:
EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OBVAL, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
With an increasing penetration of ubiquitous connectivity, the amount of data describing the actions of end-users has been increasing dramatically, both within the domain of the Internet of Things ...(IoT) and other smart devices. This has led to more awareness of users in terms of protecting personal data. Within the IoT, there is a growing number of peer-to-peer (P2P) transactions, increasing the exposure to security vulnerabilities, and the risk of cyberattacks. Blockchain technology has been explored as middleware in P2P transactions, but existing solutions have mainly focused on providing a safe environment for data trade without considering potential changes in interaction topologies. we present EdgeBoT, a proof-of-concept smart contracts based platform for the IoT built on top of the ethereum blockchain. With the Blockchain of Things (BoT) at the edge of the network, EdgeBoT enables a wider variety of interaction topologies between nodes in the network and external services while guaranteeing ownership of data and end users’ privacy. in EdgeBoT, edge devices trade their data directly with third parties and without the need of intermediaries. This opens the door to new interaction modalities, in which data producers at the edge grant access to batches of their data to different third parties. Leveraging the immutability properties of blockchains, together with the distributed nature of smart contracts, data owners can audit and are aware of all transactions that have occurred with their data. we report initial results demonstrating the potential of EdgeBoT within the IoT. we show that integrating our solutions on top of existing IoT systems has a relatively small footprint in terms of computational resource usage, but a significant impact on the protection of data ownership and management of data trade.
Full text
Available for:
IZUM, KILJ, NUK, PILJ, PNG, SAZU, UL, UM, UPUK
In this paper, we construct three classes of permutation quadrinomials with Niho exponents of the form
f
(
x
)
=
α
0
x
r
+
α
1
x
s
1
(
p
m
-
1
)
+
r
+
α
2
x
s
2
(
p
m
-
1
)
+
r
+
α
3
x
s
3
(
p
m
-
1
...)
+
r
∈
F
p
n
x
, where
p
is an odd prime,
n
=
2
m
is a positive even integer, and
(
r
,
s
1
,
s
2
,
s
3
)
=
(
1
,
-
1
p
k
-
2
,
1
,
p
k
-
1
p
k
-
2
)
,
(
1
,
p
k
+
1
p
k
+
2
,
1
,
1
p
k
+
2
)
and (3, 1, 2, 3), respectively. The exponents of the first two classes are considered for the first time, and the third class covers all the permutation polynomials proposed by Gupta (Designs Codes and Cryptography
88
, 1–17,
2020
).
Full text
Available for:
EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
PDF
