


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.
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 26 matches
- 2006
- Bart Preneel, Stafford E. Tavares:
Selected Areas in Cryptography, 12th International Workshop, SAC 2005, Kingston, ON, Canada, August 11-12, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3897, Springer 2006, ISBN 3-540-33108-5 [contents] - 2005
- Adrian Antipa, Daniel R. L. Brown, Robert P. Gallant, Robert J. Lambert, René Struik, Scott A. Vanstone:
Accelerated Verification of ECDSA Signatures. Selected Areas in Cryptography 2005: 307-318 - Frederik Armknecht
, Willi Meier:
Fault Attacks on Combiners with Memory. Selected Areas in Cryptography 2005: 36-50 - Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
Minimality of the Hamming Weight of the T-NAF for Koblitz Curves and Improved Combination with Point Halving. Selected Areas in Cryptography 2005: 332-344 - Gildas Avoine, Etienne Dysli, Philippe Oechslin:
Reducing Time Complexity in RFID Systems. Selected Areas in Cryptography 2005: 291-306 - Thomas Baignères, Serge Vaudenay:
Proving the Security of AES Substitution-Permutation Network. Selected Areas in Cryptography 2005: 65-81 - Elad Barkan, Eli Biham:
Conditional Estimators: An Effective Attack on A5/1. Selected Areas in Cryptography 2005: 1-19 - Paulo S. L. M. Barreto, Michael Naehrig:
Pairing-Friendly Elliptic Curves of Prime Order. Selected Areas in Cryptography 2005: 319-331 - Alex Biryukov
, Sourav Mukhopadhyay, Palash Sarkar:
Improved Time-Memory Trade-Offs with Multiple Data. Selected Areas in Cryptography 2005: 110-127 - An Braeken
, Joseph Lano:
On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners. Selected Areas in Cryptography 2005: 159-174 - Joachim von zur Gathen, Jamshid Shokrollahi:
Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2. Selected Areas in Cryptography 2005: 359-369 - William Eric Hall, Charanjit S. Jutla:
Parallelizable Authentication Trees. Selected Areas in Cryptography 2005: 95-109 - Matthew Henricksen, Ed Dawson
:
Rekeying Issues in the MUGI Stream Cipher. Selected Areas in Cryptography 2005: 175-188 - Éliane Jaulmes, Frédéric Muller:
Cryptanalysis of the F-FCSR Stream Cipher Family. Selected Areas in Cryptography 2005: 20-35 - Sanggon Lee, Yvonne Hitchcock, Youngho Park, Sang-Jae Moon:
Provably Secure Tripartite Password Protected Key Exchange Protocol Based on Elliptic Curves. Selected Areas in Cryptography 2005: 205-220 - Jooyoung Lee, Douglas R. Stinson:
Tree-Based Key Distribution Patterns. Selected Areas in Cryptography 2005: 189-204 - Duo Lei, Chao Li, Keqin Feng:
New Observation on Camellia. Selected Areas in Cryptography 2005: 51-64 - Serge Mister, Robert J. Zuccherato:
An Attack on CFB Mode Encryption as Used by OpenPGP. Selected Areas in Cryptography 2005: 82-94 - David Molnar, Andrea Soppera, David A. Wagner:
A Scalable, Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags. Selected Areas in Cryptography 2005: 276-290 - Norbert Pramstaller, Christian Rechberger, Vincent Rijmen
:
Breaking a New Hash Function Design Strategy Called SMASH. Selected Areas in Cryptography 2005: 233-244 - Norbert Pramstaller, Christian Rechberger, Vincent Rijmen
:
Impact of Rotations in SHA-1 and Related Hash Functions. Selected Areas in Cryptography 2005: 261-275 - Nicolas Thériault:
SPA Resistant Left-to-Right Integer Recodings. Selected Areas in Cryptography 2005: 345-358 - Jiang Wu, Ruizhong Wei:
An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security. Selected Areas in Cryptography 2005: 221-232 - Hirotaka Yoshida, Alex Biryukov:
Analysis of a SHA-256 Variant. Selected Areas in Cryptography 2005: 245-260 - Taek-Young Youn, Young-Ho Park
, Chang Han Kim, Jongin Lim:
An Efficient Public Key Cryptosystem with a Privacy Enhanced Double Decryption Mechanism. Selected Areas in Cryptography 2005: 144-158 - Adam L. Young, Moti Yung:
A Space Efficient Backdoor in RSA and Its Applications. Selected Areas in Cryptography 2005: 128-143 - service temporarily not available
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.
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.
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.
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 2025-03-13 13:50 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
