Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Kangquan Li"'
Publikováno v:
IEEE Transactions on Information Theory. 67:7561-7567
In this paper, we aim to construct a class of complete permutations $\mathcal F$ over $\mathbb F_{q}^{n}$ from some polynomials $f_{1},f_{2},\ldots,f_{n}$ over $\mathbb F_{q}$ . First of all, we determine a necessary and sufficient condition such tha
Publikováno v:
Finite Fields and Their Applications. 88:102190
Publikováno v:
Cryptography and Communications. 14:371-393
The differential (resp. boomerang) spectrum is an important parameter to estimate the resistance of cryptographic functions against some variants of differential (resp. boomerang) cryptanalysis. This paper aims to determine the differential and boome
Publikováno v:
Cryptography and Communications. 13:459-473
Bent functions are extremal combinatorial objects with several applications, such as coding theory, maximum length sequences, cryptography, the theory of difference sets, etc. Based on C. Carlet’s secondary construction, S. Mesnager proposed in 201
$n$-to-$1$ mappings have wide applications in many areas, especially in cryptography, finite geometry, coding theory and combinatorial design. In this paper, many classes of $n$-to-$1$ mappings over finite fields are studied. First, we provide a char
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6957f4b59c78b0f5215016b04fa57f24
Publikováno v:
IEEE Transactions on Information Theory
acceptedVersion
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f90b6d457bebbf4dadf730435bf0b71d
https://hdl.handle.net/11250/3062133
https://hdl.handle.net/11250/3062133
Publikováno v:
Designs, Codes and Cryptography. 88:533-552
In 1994, Klapper and Goresky (Proceedings of the 1993 Cambridge Security Workshop, Lecture Notes in Computer Science, vol 809, Cambridge, pp 174–178, 1994) proposed a new device called feedback with carry shift register to generate pseudo-random se
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1504-1511
Publikováno v:
Cryptography and Communications. 12:165-185
Involutions over finite fields are permutations whose compositional inverses are themselves. Involutions especially over $ \mathbb {F}_{q} $ with q is even have been used in many applications, including cryptography and coding theory. The explicit st
Publikováno v:
IEEE Transactions on Information Theory
In this paper, we apply two-to-one functions over $\mathbb{F}_{2^n}$ in two generic constructions of binary linear codes. We consider two-to-one functions in two forms: (1) generalized quadratic functions; and (2) $\left(x^{2^t}+x\right)^e$ with $\gc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b69284c05b0bd19e0ac299509c03fc8
https://hdl.handle.net/11250/2986825
https://hdl.handle.net/11250/2986825