![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2011
- Céline Blondeau
, Benoît Gérard, Jean-Pierre Tillich:
Accurate estimates of the data complexity and success probability for various cryptanalyses. Des. Codes Cryptogr. 59(1-3): 3-34 (2011) - Andrey Bogdanov:
On unbalanced Feistel networks with contracting MDS diffusion. Des. Codes Cryptogr. 59(1-3): 35-58 (2011) - Nina Brandstätter, Gottlieb Pirsic
, Arne Winterhof
:
Correlation of the two-prime Sidel'nikov sequence. Des. Codes Cryptogr. 59(1-3): 59-68 (2011) - Lilya Budaghyan, Claude Carlet:
CCZ-equivalence of bent vectorial functions and related constructions. Des. Codes Cryptogr. 59(1-3): 69-87 (2011) - Claude Carlet:
Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions. Des. Codes Cryptogr. 59(1-3): 89-109 (2011) - Danyo Danev
, Stefan M. Dodunekov, Diana Radkova:
A family of constacyclic ternary quasi-perfect codes with covering radius 3. Des. Codes Cryptogr. 59(1-3): 111-118 (2011) - Lars Eirik Danielsen
, Matthew Geoffrey Parker:
Directed graph representation of half-rate additive codes over GF(4). Des. Codes Cryptogr. 59(1-3): 119-130 (2011) - Richard G. Gibson, Jonathan Jedwab:
Quaternary Golay sequence pairs I: even length. Des. Codes Cryptogr. 59(1-3): 131-146 (2011) - Richard G. Gibson, Jonathan Jedwab:
Quaternary Golay sequence pairs II: odd length. Des. Codes Cryptogr. 59(1-3): 147-157 (2011) - David G. Harris:
Critique of the related-key attack concept. Des. Codes Cryptogr. 59(1-3): 159-168 (2011) - Marc Joye:
How (Not) to design strong-RSA signatures. Des. Codes Cryptogr. 59(1-3): 169-182 (2011) - Torleiv Kløve:
Lower bounds on the size of spheres of permutations under the Chebychev distance. Des. Codes Cryptogr. 59(1-3): 183-191 (2011) - Philippe Langevin, Gregor Leander
:
Counting all bent functions in dimension eight 99270589265934370305785861242880. Des. Codes Cryptogr. 59(1-3): 193-205 (2011) - Gregor Leander
, François Rodier:
Bounds on the degree of APN polynomials: the case of x-1 + g(x). Des. Codes Cryptogr. 59(1-3): 207-222 (2011) - Petr Lisonek, Marko J. Moisio:
On zeros of Kloosterman sums. Des. Codes Cryptogr. 59(1-3): 223-230 (2011) - Subhamoy Maitra, Goutam Paul, Shashwat Raizada, Subhabrata Sen, Rudradev Sengupta
:
Some observations on HC-128. Des. Codes Cryptogr. 59(1-3): 231-245 (2011) - Stéphane Manuel:
Classification and generation of disturbance vectors for collision attacks against SHA-1. Des. Codes Cryptogr. 59(1-3): 247-263 (2011) - Sihem Mesnager:
A new class of bent and hyper-bent Boolean functions in polynomial forms. Des. Codes Cryptogr. 59(1-3): 265-279 (2011) - Patric R. J. Östergård, Olli Pottonen:
Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes. Des. Codes Cryptogr. 59(1-3): 281-285 (2011) - Elif Kurtaran Özbudak, Ferruh Özbudak
, Zülfükar Saygi
:
A class of authentication codes with secrecy. Des. Codes Cryptogr. 59(1-3): 287-318 (2011) - Matthew Geoffrey Parker, Sasha Kholosha, Pascale Charpin, Eirik Rosnes:
Editorial. Des. Codes Cryptogr. 59(1-3): 1 (2011) - Alexander Pott, Yin Tan, Tao Feng
, San Ling
:
Association schemes arising from bent functions. Des. Codes Cryptogr. 59(1-3): 319-331 (2011) - Kai-Uwe Schmidt:
On the correlation distribution of Delsarte-Goethals sequences. Des. Codes Cryptogr. 59(1-3): 333-347 (2011) - Igor A. Semaev:
Sparse Boolean equations and circuit lattices. Des. Codes Cryptogr. 59(1-3): 349-364 (2011)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.
retrieved on 2024-07-06 20:34 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint