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:  
Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
Designs, Codes and Cryptography - Tập 82 - Trang 43-56 - 2016
Pavol Zajac
Lightweight cipher designs try to minimize the implementation complexity of the cipher while maintaining some specified security level. Using only a small number of AND gates lowers the implementation costs, and enables easier protections against side-channel attacks. In our paper we study the connection between the number of AND gates (multiplicative complexity) and the complexity of algebraic at...... hiện toàn bộ
Graph-theoretic design and analysis of key predistribution schemes
Designs, Codes and Cryptography - Tập 81 Số 1 - Trang 11-34 - 2016
Michaela Kendall, Keith M. Martin
Constructing Symmetric Ciphers Using the CAST Design Procedure
Designs, Codes and Cryptography - Tập 12 - Trang 283-316 - 1997
Carlisle M. Adams
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...... hiện toàn bộ
A coding problem in steganography
Designs, Codes and Cryptography - Tập 46 - Trang 67-81 - 2007
Weiming Zhang, Shiqu Li
To study how to design a steganographic algorithm more efficiently, a new coding problem—steganographic codes (abbreviated stego-codes)—is presented in this paper. The stego-codes are defined over the field with q(q ≥ 2) elements. A method of constructing linear stego-codes is proposed by using the direct sum of vector subspaces. And the problem of linear stego-codes is converted to an algebraic p...... hiện toàn bộ
Homomorphic AES evaluation using the modified LTV scheme
Designs, Codes and Cryptography - Tập 80 - Trang 333-358 - 2015
Yarkın Doröz, Yin Hu, Berk Sunar
Since its introduction more than a decade ago the homomorphic properties of the NTRU encryption scheme have gone largely ignored. A variant of NTRU proposed by Stehlé and Steinfeld was recently extended into a full fledged multi-key fully homomorphic encryption scheme by López-Alt, Tromer and Vaikuntanathan (LTV). This NTRU based FHE presents a viable alternative to the currently dominant BGV styl...... hiện toàn bộ
The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes
Designs, Codes and Cryptography - Tập 24 - Trang 313-326 - 2001
Nuh Aydin, Irfan Siap, Dijen K. Ray-Chaudhuri
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 ...... hiện toàn bộ
A recursive construction of doubly resolvable Steiner quadruple systems
Designs, Codes and Cryptography -
Zhaoping Meng, Qiang Gao, Zhanggui Wu
Concatenation of convolutional codes and rank metric codes for multi-shot network coding
Designs, Codes and Cryptography - - 2018
Diego Napp, Raquel Pinto, Vladimir Sidorenko
Bent functions in the partial spread class generated by linear recurring sequences
Designs, Codes and Cryptography - Tập 91 - Trang 63-82 - 2022
Maximilien Gadouleau, Luca Mariot, Stjepan Picek
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...... hiện toàn bộ
An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
Designs, Codes and Cryptography - Tập 83 - Trang 283-305 - 2016
M. Kuijper, R. Pinto
The construction of shortest feedback shift registers for a finite sequence $$S_1,\ldots ,S_N$$ is considered over finite chain rings, such as $${\mathbb Z}_{p^r}$$ ...... hiện toàn bộ
Tổng số: 2,245   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10