Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Bruce M. Kapron"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)
The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming lang
Externí odkaz:
https://doaj.org/article/299991e51aa94e4bb9274202323caa7a
Autor:
Bruce M. Kapron, Florian Steinberg
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 298, Iss Proc. DICE-FOPARA 2019, Pp 61-73 (2019)
Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time computability. In particular, in a type-two setting, we consider function
Externí odkaz:
https://doaj.org/article/5bf38b2fcad046ae865672332277f9b5
Publikováno v:
Nuclear Physics B, Vol 910, Iss C, Pp 712-723 (2016)
Graphs embedded into surfaces have many important applications, in particular, in combinatorics, geometry, and physics. For example, ribbon graphs and their counting is of great interest in string theory and quantum field theory (QFT). Recently, Koch
Externí odkaz:
https://doaj.org/article/182858c47cb448ad9590c8435649cfe1
Publikováno v:
Logical Methods in Computer Science
Logical Methods in Computer Science, 2022, 18 (1), pp.31. ⟨10.46298/LMCS-18(1:33)2022⟩
LICS
LICS '20-35th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS '20-35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.535-549, ⟨10.1145/3373718.3394768⟩
Logical Methods in Computer Science, 2022, 18 (1), pp.31. ⟨10.46298/LMCS-18(1:33)2022⟩
LICS
LICS '20-35th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS '20-35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.535-549, ⟨10.1145/3373718.3394768⟩
International audience; The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a78ddfaacee771c9dfa2aac79e5d1e71
https://inria.hal.science/hal-03722168/document
https://inria.hal.science/hal-03722168/document
Publikováno v:
EPJ quantum technology. 9(1)
Authentication plays a critical role in the security of quantum key distribution (QKD) protocols. We propose using Polynomial Hash and its variants for authentication of variable length messages in QKD protocols. Since universal hashing is used not o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a166f7c9924502fcce9ff4534c0f45e
https://pubmed.ncbi.nlm.nih.gov/35224512
https://pubmed.ncbi.nlm.nih.gov/35224512
Publikováno v:
Discrete Mathematics. 342:3057-3061
Recently, Grynkiewicz et al. (2013), using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence a 1 x 1 + ⋯ + a k x k ≡ b ( mod n ) , where a 1 , … , a k , b , n ( n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::766dab194a96a9acc3fa23c3ffdada35
https://doi.org/10.1016/j.disc.2019.06.016
https://doi.org/10.1016/j.disc.2019.06.016
Autor:
Bruce M. Kapron
Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for “his advancement of our understanding o
Let $\Z_n[i]$ be the ring of Gaussian integers modulo a positive integer $n$. Very recently, Camarero and Mart\'{i}nez [IEEE Trans. Inform. Theory, {\bf 62} (2016), 1183--1192], showed that for every prime number $p>5$ such that $p\equiv \pm 5 \pmod{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bcd23a055ea46adc6e5a9777cfbdc8f3
http://arxiv.org/abs/2010.05407
http://arxiv.org/abs/2010.05407
Publikováno v:
Journal of Number Theory. 171:128-144
In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pmod{n}$, with $\gcd(x_i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1803649a1eb2b3a287878874469a7a27
https://doi.org/10.1016/j.jnt.2016.07.018
https://doi.org/10.1016/j.jnt.2016.07.018
Autor:
Mohammad Hajiabadi, Bruce M. Kapron
Publikováno v:
Journal of Cryptology. 30:1187-1237
We give generic constructions of several fundamental cryptographic primitives based on a new encryption primitive that combines circular security for bit encryption with the so-called reproducibility property (Bellare et al. PKC 2003). At the heart o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9eaab574d6dfe14369cc1b38420c1f8
https://doi.org/10.1007/s00145-016-9246-4
https://doi.org/10.1007/s00145-016-9246-4