Остановите войну!
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 34 matches
- 2001
- Michel Abdalla, Mihir Bellare, Phillip Rogaway:
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES. CT-RSA 2001: 143-158 - Michel Abdalla, Sara K. Miner, Chanathip Namprempre:
Forward-Secure Threshold Signature Schemes. CT-RSA 2001: 441-456 - Iris Anshel, Michael Anshel, Benji Fisher, Dorian Goldfeld:
New Key Agreement Protocols in Braid Group Cryptography. CT-RSA 2001: 13-27 - Geneviève Arboit, Jean-Marc Robert:
From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes. CT-RSA 2001: 44-51 - Michael Brown, Darrel Hankerson, Julio César López-Hernández, Alfred Menezes:
Software Implementation of the NIST Elliptic Curves Over Prime Fields. CT-RSA 2001: 250-265 - Daniel R. L. Brown, Don B. Johnson:
Formal Security Proofs for a Signature Scheme with Partial Message Recovery. CT-RSA 2001: 126-142 - Nicolas T. Courtois:
The Security of Hidden Field Equations (HFE). CT-RSA 2001: 266-281 - Marc Fischlin:
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. CT-RSA 2001: 457-472 - Kris Gaj, Pawel Chodowiec:
Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays. CT-RSA 2001: 84-99 - Philippe Golle, Ilya Mironov:
Uncheatable Distributed Computations. CT-RSA 2001: 425-440 - Helena Handschuh, Lars R. Knudsen, Matthew J. B. Robshaw:
Analysis of SHA-1 in Encryption Mode. CT-RSA 2001: 70-83 - Amir Herzberg, Yosi Mass:
Relying Party Credentials Framework. CT-RSA 2001: 328-343 - Detlef Hühnlein:
Faster Generation of NICE-Schnorr-Type Signatures. CT-RSA 2001: 1-12 - David P. Jablon:
Password Authentication Using Multiple Servers. CT-RSA 2001: 344-360 - Markus Jakobsson, David Pointcheval, Adam L. Young:
Secure Mobile Gambling. CT-RSA 2001: 110-125 - Markus Jakobsson, Susanne Wetzel:
Security Weaknesses in Bluetooth. CT-RSA 2001: 176-191 - Marc Joye, Jean-Jacques Quisquater, Moti Yung:
On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC. CT-RSA 2001: 208-222 - Ari Juels:
Targeted Advertising ... And Privacy Too. CT-RSA 2001: 408-424 - Eyal Kushilevitz, Tal Rabin:
Fair e-Lotteries and e-Casinos. CT-RSA 2001: 100-109 - Philip D. MacKenzie:
More Efficient Password-Authenticated Key Exchange. CT-RSA 2001: 361-377 - Alfred Menezes, Minghua Qu:
Analysis of the Weil Descent Attack of Gaudry, Hess and Smart. CT-RSA 2001: 308-318 - Tatsuaki Okamoto, David Pointcheval:
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform. CT-RSA 2001: 159-175 - Paul Onions:
On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys. CT-RSA 2001: 63-69 - Jacques Patarin, Nicolas T. Courtois, Louis Goubin:
QUARTZ, 128-Bit Long Digital Signatures. CT-RSA 2001: 282-297 - Jacques Patarin, Nicolas T. Courtois, Louis Goubin:
FLASH, a Fast Multivariate Signature Algorithm. CT-RSA 2001: 298-307 - Jean-Pierre Seifert:
Using Fewer Qubits in Shor's Factorization Algorithm Via Simultaneous Diophantine Approximation. CT-RSA 2001: 319-327 - Hovav Shacham, Dan Boneh:
Improving SSL Handshake Performance via Batching. CT-RSA 2001: 28-43 - Ron Steinfeld, Yuliang Zheng:
An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits. CT-RSA 2001: 52-62 - Alexander Tiountchik, Elena Trichina:
Modular Exponentiation on Fine-Grained FPGA. CT-RSA 2001: 223-234 - Elena Trichina, Alexander Tiountchik:
Scalable Algorithm for Montgomery Multiplication and Its Implementation on the Coarse-Grain Reconfigurable Chip. CT-RSA 2001: 235-249
skipping 4 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-31 07:08 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