Остановите войну!
for scientists:
default search action
Joan Boyar
- > Home > Persons > Joan Boyar
Publications
- 2019
- [j50]Joan Boyar, Magnus Gausdal Find, René Peralta:
Small low-depth circuits for cryptographic applications. Cryptogr. Commun. 11(1): 109-127 (2019) - 2016
- [j39]Joan Boyar, Magnus Gausdal Find, René Peralta:
On various nonlinearity measures for boolean functions. Cryptogr. Commun. 8(3): 313-330 (2016) - 2013
- [j32]Joan Boyar, Philip Matthews, René Peralta:
Logic Minimization Techniques with Applications to Cryptology. J. Cryptol. 26(2): 280-312 (2013) - [c32]Joan Boyar, Magnus Find, René Peralta:
Four Measures of Nonlinearity. CIAC 2013: 61-72 - [i9]Joan Boyar, Magnus Find, René Peralta:
Four Measures of Nonlinearity. IACR Cryptol. ePrint Arch. 2013: 633 (2013) - 2012
- [c27]Joan Boyar, René Peralta:
A Small Depth-16 Circuit for the AES S-Box. SEC 2012: 287-298 - 2011
- [i4]Joan Boyar, René Peralta:
A depth-16 circuit for the AES S-box. IACR Cryptol. ePrint Arch. 2011: 332 (2011) - 2010
- [c25]Joan Boyar, René Peralta:
A New Combinational Logic Minimization Technique with Applications to Cryptology. SEA 2010: 178-189 - 2009
- [i3]Joan Boyar, René Peralta:
New logic minimization techniques with applications to cryptology. IACR Cryptol. ePrint Arch. 2009: 191 (2009) - 2008
- [j24]Joan Boyar, René Peralta:
Tight bounds for the multiplicative complexity of symmetric functions. Theor. Comput. Sci. 396(1-3): 223-246 (2008) - [c23]Joan Boyar, Philip Matthews, René Peralta:
On the Shortest Linear Straight-Line Program for Computing Linear Forms. MFCS 2008: 168-179 - 2006
- [c22]Joan Boyar, René Peralta:
Concrete Multiplicative Complexity of Symmetric Functions. MFCS 2006: 179-189 - 2005
- [i1]Joan Boyar, René Peralta:
The Exact Multiplicative Complexity of the Hamming Weight Function. Electron. Colloquium Comput. Complex. TR05 (2005) - 2000
- [j14]Joan Boyar, Ivan Damgård, René Peralta:
Short Non-Interactive Cryptographic Proofs. J. Cryptol. 13(4): 449-472 (2000) - [j13]Joan Boyar, René Peralta, Denis Pochuev:
On the multiplicative complexity of Boolean functions over the basis (cap, +, 1). Theor. Comput. Sci. 235(1): 43-57 (2000) - 1996
- [c9]Joan Boyar, René Peralta:
Short Discrete Proofs. EUROCRYPT 1996: 131-142 - 1995
- [j10]Joan Boyar, Gilles Brassard, René Peralta:
Subquadratic Zero-Knowledge. J. ACM 42(6): 1169-1193 (1995) - 1993
- [j7]Joan Boyar, Carsten Lund, René Peralta:
On the Communication Complexity of Zero-Knowledge Proofs. J. Cryptol. 6(2): 65-85 (1993) - 1991
- [c6]Joan Boyar, Gilles Brassard, René Peralta:
Subquadratic Zero-Knowledge. FOCS 1991: 69-78 - 1989
- [c4]Joan Boyar, René Peralta:
On the Concrete Complexity of Zero-Knowledge Proofs. CRYPTO 1989: 507-525
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-11 23:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint