Остановите войну!
for scientists:
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 67 matches
- 2018
- Santiago Barrera Acevedo, Heiko Dietrich:
Perfect sequences over the quaternions and (4n, 2, 4n, 2n)-relative difference sets in C n × Q 8. Cryptogr. Commun. 10(2): 357-368 (2018) - Yousuf Alsalami:
Constructions with high algebraic degree of differentially 4-uniform (n, n - 1)-functions and differentially 8-uniform (n, n - 2)-functions. Cryptogr. Commun. 10(4): 611-628 (2018) - Nurdagül Anbar, Wilfried Meidl:
Modified planar functions and their components. Cryptogr. Commun. 10(2): 235-249 (2018) - Tao Bai, Yongbo Xia:
A new class of permutation trinomials constructed from Niho exponents. Cryptogr. Commun. 10(6): 1023-1036 (2018) - Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani:
A 2D non-overlapping code over a q-ary alphabet. Cryptogr. Commun. 10(4): 667-683 (2018) - Srimanta Bhattacharya, Mridul Nandi:
A note on the chi-square method: A tool for proving cryptographic security. Cryptogr. Commun. 10(5): 935-957 (2018) - Sonia Bogos, John Gaspoz, Serge Vaudenay:
Cryptanalysis of a homomorphic encryption scheme. Cryptogr. Commun. 10(1): 27-39 (2018) - Serdar Boztas, Ferruh Özbudak, Eda Tekin:
Generalized nonbinary sequences with perfect autocorrelation, flexible alphabets and new periods. Cryptogr. Commun. 10(3): 509-517 (2018) - Claude Carlet:
On the nonlinearity of monotone Boolean functions. Cryptogr. Commun. 10(6): 1051-1061 (2018) - Claude Carlet, Sylvain Guilley:
Statistical properties of side-channel and fault injection attacks using coding theory. Cryptogr. Commun. 10(5): 909-933 (2018) - Francis N. Castro, Luis A. Medina, Ivelisse M. Rubio:
Exact 2-divisibility of exponential sums associated to boolean functions. Cryptogr. Commun. 10(4): 655-666 (2018) - Zuling Chang, Martianus Frederic Ezerman, San Ling, Huaxiong Wang:
Construction of de Bruijn sequences from product of two irreducible polynomials. Cryptogr. Commun. 10(2): 251-275 (2018) - Zuling Chang, Martianus Frederic Ezerman, San Ling, Huaxiong Wang:
The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields. Cryptogr. Commun. 10(6): 1183-1202 (2018) - Eloi de Chérisey, Sylvain Guilley, Annelie Heuser, Olivier Rioul:
On the optimality and practicability of mutual information analysis in some scenarios. Cryptogr. Commun. 10(1): 101-121 (2018) - Tingting Cui, Huaifeng Chen, Sihem Mesnager, Ling Sun, Meiqin Wang:
Statistical integral distinguisher with multi-structure and its application on AES-like ciphers. Cryptogr. Commun. 10(5): 755-776 (2018) - Tingting Cui, Huaifeng Chen, Long Wen, Meiqin Wang:
Statistical integral attack on CAST-256 and IDEA. Cryptogr. Commun. 10(1): 195-209 (2018) - Cunsheng Ding:
A sequence construction of cyclic codes over finite fields. Cryptogr. Commun. 10(2): 319-341 (2018) - Elena Dubrova, Mats Näslund, Göran Selander, Fredrik Lindqvist:
Message Authentication Based on Cryptographically Secure CRC without Polynomial Irreducibility Test. Cryptogr. Commun. 10(2): 383-399 (2018) - Tomás Fabsic, Otokar Grosek, Karol Nemoga, Pavol Zajac:
On generating invertible circulant binary matrices with a prescribed number of ones. Cryptogr. Commun. 10(1): 159-175 (2018) - Houda Ferradi, Rémi Géraud, Diana Maimut, David Naccache, Hang Zhou:
Backtracking-assisted multiplication. Cryptogr. Commun. 10(1): 17-26 (2018) - Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
POEx: A beyond-birthday-bound-secure on-line cipher. Cryptogr. Commun. 10(1): 177-193 (2018) - Lucky Galvez, Jon-Lark Kim, Nari Lee, Young Gun Roe, Byung-Sun Won:
Some bounds on binary LCD codes. Cryptogr. Commun. 10(4): 719-728 (2018) - Mokshi Goyal, Madhu Raka:
Quadratic residue codes over the ring 𝔽p[u]/〈 um - u 〉 and their Gray images. Cryptogr. Commun. 10(2): 343-355 (2018) - Ting Gu, Zhixiong Chen, Andrew Klapper:
Correlation immune functions with respect to the q-transform. Cryptogr. Commun. 10(6): 1063-1073 (2018) - Matthias Hamann, Matthias Krause:
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks. Cryptogr. Commun. 10(5): 959-1012 (2018) - Matthias Hamann, Matthias Krause, Willi Meier, Bin Zhang:
Design and analysis of small-state grain-like stream ciphers. Cryptogr. Commun. 10(5): 803-834 (2018) - Sartaj Ul Hasan, Daniel Panario, Qiang Wang:
Nonlinear vectorial primitive recursive sequences. Cryptogr. Commun. 10(6): 1075-1090 (2018) - Tor Helleseth, Bart Preneel:
Editorial: Special issue on recent trends in cryptography. Cryptogr. Commun. 10(1): 1-3 (2018) - Brett Hemenway, Rafail Ostrovsky:
Efficient robust secret sharing from expander graphs. Cryptogr. Commun. 10(1): 79-99 (2018) - Amit Jana, Goutam Paul:
Revisiting RC4 key collision: Faster search algorithm and new 22-byte colliding key pairs. Cryptogr. Commun. 10(3): 479-508 (2018)
skipping 37 more matches
loading more results
failed to load more results, please try again later
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-05-27 22:29 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