Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Petr Lisonek"'
Magic sets of observables are minimal structures that capture quantum state-independent advantage for systems of $n\ge 2$ qubits and are, therefore, fundamental tools for investigating the interface between classical and quantum physics. A theorem by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a35df5e6dcb7dc892906b88c09f7128
Autor:
Petr Lisonek, Benjamin Chase
The problem of finding APN permutations of ${\mathbb F}_{2^n}$ where $n$ is even and $n>6$ has been called the Big APN Problem. Li, Li, Helleseth and Qu recently characterized APN functions defined on ${\mathbb F}_{q^2}$ of the form $f(x)=x^{3q}+a_1x
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::185cbf3841257d73353808e92af24248
Autor:
Lucien Lapierre, Petr Lisonek
Publikováno v:
ISIT
We study vectorial bent functions with Dillon-type exponents. These functions have attracted attention because they are hyperbent whenever they are bent, and they achieve the highest possible algebraic degree among all bent functions on the same doma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ebe6a63d0c6d98d15a776405a65f2f7
https://doi.org/10.1109/isit.2016.7541347
https://doi.org/10.1109/isit.2016.7541347
Publikováno v:
IEEE Transactions on Information Theory. 58:2516-2523
Kloosterman sums are exponential sums on finite fields that have important applications in cryptography and coding theory. We use Stickelberger's theorem and the Gross-Koblitz formula to determine the value of the binary Kloosterman sum at a modulo 6
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55cbaf8c82389c6bcc4e3a9c6468f93d
https://doi.org/10.1109/tit.2011.2176914
https://doi.org/10.1109/tit.2011.2176914
Autor:
Petr Lisonek
Publikováno v:
IEEE Transactions on Information Theory. 57:6010-6014
Charpin and Gong recently characterized a large class of hyperbent functions defined on fields of order 2n, which include the well-known monomial functions with the Dillon exponent as a special case. We give a reformulation of the Charpin-Gong criter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::060de4d72557a19eaf350819496fa4bd
https://doi.org/10.1109/tit.2011.2162171
https://doi.org/10.1109/tit.2011.2162171
This book constitutes the proceedings of the 20th International Conference on Selected Areas in Cryptography, SAC 2013, held in Burnaby, Canada, in August 2013. The 26 papers presented in this volume were carefully reviewed and selected from 98 submi
Autor:
Jessica Fridrich, Petr Lisonek
Publikováno v:
IEEE Transactions on Information Theory. 53:1547-1549
A proper vertex coloring of a graph is called rainbow if, for each vertex v, all neighbors of v receive distinct colors. A k-regular graph G is called rainbow (or domatically full) if it admits a rainbow (k+1)-coloring. The d-dimensional grid graph G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96a6354070cbd6aad2e4456dfe234361
https://doi.org/10.1109/tit.2007.892768
https://doi.org/10.1109/tit.2007.892768
Autor:
Jiqí Bajer, Petr Lisonek
Publikováno v:
Journal of Modern Optics. 38:719-729
The description and demonstration of a short-time approximation method are presented for solution of the Heisenberg equation using a computer for operator algebra symbolic computation to obtain an operator series. Multimode nonlinear processes can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::414d8f14b94e0de6e22f11692f0eb06f
https://doi.org/10.1080/09500349114550711
https://doi.org/10.1080/09500349114550711
Autor:
Petr Lisonek, Jeffrey Farr
Publikováno v:
Innov. Incidence Geom. 4, no. 1 (2006), 69-88
A cap in PG [math] is said to have a free pair of points if any plane containing that pair contains at most one other point from the cap. In an earlier paper we determined the largest size of caps with free pairs for [math] and [math] . In this paper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b4ab0571b10845315d4b59f0ac0f37b
https://projecteuclid.org/euclid.iig/1551323225
https://projecteuclid.org/euclid.iig/1551323225
Publikováno v:
Security, Steganography, and Watermarking of Multimedia Contents
In this paper, we show that the communication channel known as writing in memory with defective cells is a relevant information-theoretical model for a specific case of passive warden steganography when the sender embeds a secret message into a subse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::645c044798ca9e5541a2fc3ad3692b69
https://doi.org/10.1117/12.583160
https://doi.org/10.1117/12.583160