Остановите войну!
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 30 matches
- 2009
- Roberto Maria Avanzi, Liam Keliher, Francesco Sica:
Selected Areas in Cryptography, 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers. Lecture Notes in Computer Science 5381, Springer 2009, ISBN 978-3-642-04158-7 [contents] - 2008
- Frédéric Amiel, Benoit Feix, Michael Tunstall, Claire Whelan, William P. Marnane:
Distinguishing Multiplications from Squaring Operations. Selected Areas in Cryptography 2008: 346-360 - Elena Andreeva, Bart Preneel:
A Three-Property-Secure Hash Function. Selected Areas in Cryptography 2008: 228-244 - Kazumaro Aoki, Yu Sasaki:
Preimage Attacks on One-Block MD4, 63-Step MD5 and More. Selected Areas in Cryptography 2008: 103-119 - Jean-Philippe Aumasson, Willi Meier, Florian Mendel:
Preimage Attacks on 3-Pass HAVAL and Step-Reduced MD5. Selected Areas in Cryptography 2008: 120-135 - Côme Berbain, Henri Gilbert, Antoine Joux:
Algebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift Registers. Selected Areas in Cryptography 2008: 184-198 - Peter Birkner, Nicolas Thériault:
Faster Halvings in Genus 2. Selected Areas in Cryptography 2008: 1-17 - Charles Bouillaguet, Pierre-Alain Fouque:
Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques. Selected Areas in Cryptography 2008: 245-261 - Jonathan Etrog, Matthew J. B. Robshaw:
The Cryptanalysis of Reduced-Round SMS4. Selected Areas in Cryptography 2008: 51-65 - Junfeng Fan, Lejla Batina, Ingrid Verbauwhede:
HECC Goes Embedded: An Area-Efficient Implementation of HECC. Selected Areas in Cryptography 2008: 387-400 - Xinxin Fan, Guang Gong, David Jao:
Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates. Selected Areas in Cryptography 2008: 18-34 - Pierre-Alain Fouque, Jacques Stern, Sébastien Zimmer:
Cryptanalysis of Tweaked Versions of SMASH and Reparation. Selected Areas in Cryptography 2008: 136-150 - Philipp Grabher, Johann Großschädl, Dan Page:
On Software Parallel Implementation of Cryptographic Pairings. Selected Areas in Cryptography 2008: 35-50 - Somayeh Heidarvand, Jorge L. Villar:
Public Verifiability from Pairings in Secret Sharing Schemes. Selected Areas in Cryptography 2008: 294-308 - Daniel M. Hein, Johannes Wolkerstorfer, Norbert Felber:
ECC Is Ready for RFID - A Proof in Silicon. Selected Areas in Cryptography 2008: 401-413 - Shoichi Hirose, Hidenori Kuwakado:
A Scheme to Base a Hash Function on a Block Cipher. Selected Areas in Cryptography 2008: 262-275 - Sebastiaan Indesteege, Florian Mendel, Bart Preneel, Christian Rechberger:
Collisions and Other Non-random Properties for Step-Reduced SHA-256. Selected Areas in Cryptography 2008: 276-293 - Ramakanth Kavuluru, Andrew Klapper:
Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences. Selected Areas in Cryptography 2008: 151-164 - Kristin E. Lauter, Katherine E. Stange:
The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences. Selected Areas in Cryptography 2008: 309-327 - Wil Michiels, Paul Gorissen, Henk D. L. Hollmann:
Cryptanalysis of a Generic Class of White-Box Implementations. Selected Areas in Cryptography 2008: 414-428 - Jacques Patarin:
The "Coefficients H" Technique. Selected Areas in Cryptography 2008: 328-345 - Jacques Patarin, Yannick Seurin:
Building Secure Block Ciphers on Generic Attacks Assumptions. Selected Areas in Cryptography 2008: 66-81 - Matthieu Rivain:
On the Exact Success Rate of Side Channel Analysis in the Gaussian Model. Selected Areas in Cryptography 2008: 165-183 - Éric Schost, Arash Hariri:
Subquadratic Polynomial Multiplication over GF(2m) Using Trinomial Bases and Chinese Remaindering. Selected Areas in Cryptography 2008: 361-372 - Joseph H. Silverman:
Lifting and Elliptic Curve Discrete Logarithms. Selected Areas in Cryptography 2008: 82-102 - Kyohei Suzuki, Tetsu Iwata:
Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators. Selected Areas in Cryptography 2008: 373-386 - Meiqin Wang, Xiaoyun Wang, Changhui Hu:
New Linear Cryptanalytic Results of Reduced-Round of CAST-128 and CAST-256. Selected Areas in Cryptography 2008: 429-441 - Wenling Wu, Lei Zhang, Wentao Zhang:
Improved Impossible Differential Cryptanalysis of Reduced-Round Camellia. Selected Areas in Cryptography 2008: 442-456 - Erik Zenner:
A Cache Timing Analysis of HC-256. Selected Areas in Cryptography 2008: 199-213 - Bin Zhang, Dengguo Feng:
An Improved Fast Correlation Attack on Stream Ciphers. Selected Areas in Cryptography 2008: 214-227
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-24 09:53 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