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 17 matches
- 2008
- Bora Aslan, M. Tolga Sakalli, Ercan Bulus:
Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions. WAIFI 2008: 123-133 - Selçuk Baktir, Berk Sunar:
Optimal Extension Field Inversion in the Frequency Domain. WAIFI 2008: 47-61 - Fabrizio Caruso, Jacopo D'Aurizio, Alasdair McAndrew:
Efficient Finite Fields in the Maxima Computer Algebra System. WAIFI 2008: 62-76 - Sylvain Duquesne:
Montgomery Ladder for All Genus 2 Curves in Characteristic 2. WAIFI 2008: 174-188 - Olav Geil, Ryutaroh Matsumoto, Casper Thomsen:
On Field Size and Success Probability in Network Coding. WAIFI 2008: 157-173 - Yoshinori Hamahata:
Finite Dedekind Sums. WAIFI 2008: 11-18 - Arash Hariri, Arash Reyhani-Masoleh:
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields. WAIFI 2008: 103-116 - M. Anwar Hasan, Christophe Nègre:
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. WAIFI 2008: 88-102 - Kathy J. Horadam:
EA and CCZ Equivalence of Functions over GF(2n). WAIFI 2008: 134-143 - Marc Joye:
Fast Point Multiplication on Elliptic Curves without Precomputation. WAIFI 2008: 36-46 - Miroslav Knezevic, Kazuo Sakiyama, Junfeng Fan, Ingrid Verbauwhede:
Modular Reduction in GF(2n) without Pre-computational Phase. WAIFI 2008: 77-87 - Gohar M. Kyureghyan, Alexander Pott:
Some Theorems on Planar Mappings. WAIFI 2008: 117-122 - Gerasimos C. Meletiou, Arne Winterhof:
Interpolation of the Double Discrete Logarithm. WAIFI 2008: 1-10 - Marc Mouffron:
Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications. WAIFI 2008: 19-35 - Enes Pasalic:
On Cryptographically Significant Mappings over GF(2n). WAIFI 2008: 189-204 - Gerardo Vega:
On the Number of Two-Weight Cyclic Codes with Composite Parity-Check Polynomials. WAIFI 2008: 144-156 - Joachim von zur Gathen, José Luis Imaña, Çetin Kaya Koç:
Arithmetic of Finite Fields, 2nd International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings. Lecture Notes in Computer Science 5130, Springer 2008, ISBN 978-3-540-69498-4 [contents]
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-12-26 16:34 CET 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