Designs, Codes and Cryptography
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Constructing Symmetric Ciphers Using the CAST Design Procedure
Designs, Codes and Cryptography - Tập 12 - Trang 283-316 - 1997
This paper describes the CAST design procedure for constructing a family of DES-like Substitution-Permutation Network (SPN) cryptosystems which appear to have good resistance to differential cryptanalysis, linear cryptanalysis, and related-key cryptanalysis, along with a number of other desirable cryptographic properties. Details of the design choices in the procedure are given, including those re......
The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes
Designs, Codes and Cryptography - Tập 24 - Trang 313-326 - 2001
One of the most important problems of coding theory is to construct codes with best possible minimum distances. Recently, quasi-cyclic (QC) codes have been proven to contain many such codes. In this paper, we consider quasi-twisted (QT) codes, which are generalizations of QC codes, and their structural properties and obtain new codes which improve minimum distances of best known linear codes over ......
A recursive construction of doubly resolvable Steiner quadruple systems
Designs, Codes and Cryptography -
Bent functions in the partial spread class generated by linear recurring sequences
Designs, Codes and Cryptography - Tập 91 - Trang 63-82 - 2022
We present a construction of partial spread bent functions using subspaces generated by linear recurring sequences (LRS). We first show that the kernels of the linear mappings defined by two LRS have a trivial intersection if and only if their feedback polynomials are relatively prime. Then, we characterize the appropriate parameters for a family of pairwise coprime polynomials to generate a parti......
New results and applications for multi-secret sharing schemes
Designs, Codes and Cryptography - Tập 73 Số 3 - Trang 841-864 - 2014
Characterization of 2 n -periodic binary sequences with fixed 2-error or 3-error linear complexity
Designs, Codes and Cryptography - Tập 53 - Trang 75-97 - 2009
The linear complexity of sequences is an important measure of the cryptographic strength of key streams used in stream ciphers. The instability of linear complexity caused by changing a few symbols of sequences can be measured using k-error linear complexity. In their SETA 2006 paper, Fu et al. (SETA, pp. 88–103, 2006) studied the linear complexity and the 1-error linear complexity of 2
......
Full classification of permutation rational functions and complete rational functions of degree three over finite fields
Designs, Codes and Cryptography - Tập 88 - Trang 867-886 - 2020
Let q be a prime power, $$\mathbb {F}_q$$ be the finite field of order q and $$\mathbb {F}_q(x)$$ be the field of rational functions over $$\mathbb {F}_q$$. In this paper we classify and count all rational functions $$\varphi \in \mathbb {F}_q(x)$$ of degree 3 that induce a permutation of $$\mathbb {P}^1(\mathbb {F}_q)$$. As a consequence of our classification, we can show that there is no complet......
Multimedia IPP codes with efficient tracing
Designs, Codes and Cryptography - Tập 88 - Trang 851-866 - 2020
Wu et al. (IEEE Signal Process Mag 21:15–27, 2004) showed that fingerprinting system can be designed according to different criteria: catching one, catching many and catching all. For the case of “catching many”, binary multimedia identifiable parent property codes (t-MIPPCs) were introduced to construct fingerprints resistant to the averaging collusion attack on multimedia contents. In this paper......
On Bonisoli’s theorem and the block codes of Steiner triple systems
Designs, Codes and Cryptography - - 2018
Tổng số: 2,245
- 1
- 2
- 3
- 4
- 5
- 6
- 10