Zobrazeno 1 - 10
of 2 008
pro vyhledávání: '"Linear complexity"'
Autor:
Alexander Marazov, Anthony Shannon
Publikováno v:
International Journal Bioautomation, Vol 28, Iss 2, Pp 107-111 (2024)
We will show that the computation of the intercriteria counters can be done in O(n log n) time (quasi-linear complexity). Up to this point, all implementations have used O(n2) operations, which does not allow processing of data over hundreds of thous
Externí odkaz:
https://doaj.org/article/9eaf7d1fdd9f4f4cb3868a452f67acf5
Autor:
V. A. Edemskiy
Publikováno v:
Учёные записки Казанского университета. Серия Физико-математические науки, Vol 166, Iss 2 (2024)
The linear complexity of new generalized cyclotomic sequences with odd period was estimated. The sequences were defined using generalized cyclotomic classes composite modulo. Conditions sufficient for the existence of binary and non-binary sequences
Externí odkaz:
https://doaj.org/article/5f38a4e443fd42fbbc0a32628fa87e64
Publikováno v:
IEEE Access, Vol 12, Pp 117617-117626 (2024)
Recently, the transformer-based model e.g., the vision transformer (ViT) has been extensively used in computer vision tasks. The superior performance of the ViT leads to the requirement of an enormous dataset and the complexity of calculating self-at
Externí odkaz:
https://doaj.org/article/4420c4d68fc247fab9e8cf7b3f63a02c
Autor:
Chi Yan
Publikováno v:
IEEE Access, Vol 12, Pp 109210-109217 (2024)
Linear complexity is an important pseudo-random measure of the keystream sequence in a stream cipher system. The error linear complexity is employed to measure the stability of the linear complexity, which means the minimal linear complexity by chang
Externí odkaz:
https://doaj.org/article/951b028131ed42bdace58de3a8e78608
Autor:
Chi Yan, Chengliang Tian
Publikováno v:
Mathematics, Vol 12, Iss 16, p 2483 (2024)
Linear complexity is an important pseudo-random measure of the key stream sequence in a stream cipher system. The 1-error linear complexity is used to measure the stability of the linear complexity, which means the minimal linear complexity of the ne
Externí odkaz:
https://doaj.org/article/476fe8d0e7c14fa0a68a0955dd9e0d3f
Publikováno v:
Jisuanji kexue yu tansuo, Vol 17, Iss 8, Pp 1974-1980 (2023)
Boolean functions are crucial primitive in block cipher and are also used to design pseudorandom sequences. They play a crucial role in the design of symmetric cryptography and its analysis, and the study on the cryptographic properties of Boolean fu
Externí odkaz:
https://doaj.org/article/81d008e9176b4097b0be484431cb10cd
Autor:
Chunlei Li
Publikováno v:
Cryptography, Vol 8, Iss 2, p 25 (2024)
Since the introduction of the Kolmogorov complexity of binary sequences in the 1960s, there have been significant advancements on the topic of complexity measures for randomness assessment, which are of fundamental importance in theoretical computer
Externí odkaz:
https://doaj.org/article/49e7428962204ac0a8a97c4e10a09201
Publikováno v:
IEEE Access, Vol 11, Pp 25629-25641 (2023)
The detection of community structures is a very crucial research area. The problem of community detection has received considerable attention from a large portion of the scientific community. More importantly, these articles are spread across a large
Externí odkaz:
https://doaj.org/article/00b01429d3a64b62a24718df8713e3a7
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
AIMS Mathematics, Vol 7, Iss 4, Pp 5821-5829 (2022)
Jing et al. dealed with all possible Whiteman generalized cyclotomic binary sequences $ s(a, b, c) $ with period $ N = pq $, where $ (a, b, c) \in \{0, 1\}^3 $ and $ p, q $ are distinct odd primes (Jing et al. arXiv:2105.10947v1, 2021). They have det
Externí odkaz:
https://doaj.org/article/69b56b650eeb43d6ab790d3164dd786d