Остановите войну!
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 44 matches
- 2003
- Burton S. Kaliski Jr., Çetin Kaya Koç, Christof Paar:
Cryptographic Hardware and Embedded Systems - CHES 2002, 4th International Workshop, Redwood Shores, CA, USA, August 13-15, 2002, Revised Papers. Lecture Notes in Computer Science 2523, Springer 2003, ISBN 3-540-00409-2 [contents] - 2002
- Dakshi Agrawal, Bruce Archambeault, Josyula R. Rao, Pankaj Rohatgi:
The EM Side-Channel(s). CHES 2002: 29-45 - Christian Aumüller, Peter Bier, Wieland Fischer, Peter Hofreiter, Jean-Pierre Seifert:
Fault Attacks on RSA with CRT: Concrete Results and Practical Countermeasures. CHES 2002: 260-275 - Guido Bertoni, Luca Breveglieri, Pasqualina Fragneto, Marco Macchetti, Stefano Marchesin:
Efficient Software Implementation of AES on 32-Bit Platforms. CHES 2002: 159-171 - Bert den Boer, Kerstin Lemke, Guntram Wicke:
A DPA Attack against the Modular Reduction within a CRT Implementation of RSA. CHES 2002: 228-243 - Nigel Boston, T. Charles Clancy, Y. Liow, Jonathan E. Webster:
Genus Two Hyperelliptic Curve Coprocessor. CHES 2002: 400-414 - Suresh Chari, Josyula R. Rao, Pankaj Rohatgi:
Template Attacks. CHES 2002: 13-28 - Mathieu Ciet, Jean-Jacques Quisquater, Francesco Sica:
Preventing Differential Analysis in GLV Elliptic Curve Scalar Multiplication. CHES 2002: 540-550 - Richard Clayton, Mike Bond:
Experience Using a Low-Cost FPGA Design to Crack DES Keys. CHES 2002: 579-592 - M. Ernst, Michael Jung, Felix Madlener, Sorin A. Huss, Rainer Blümel:
A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2n). CHES 2002: 381-399 - Viktor Fischer, Milos Drutarovský:
True Random Number Generator Embedded in Reconfigurable Hardware. CHES 2002: 415-430 - Wieland Fischer, Jean-Pierre Seifert:
Increasing the Bitlength of a Crypto-Coprocessor. CHES 2002: 71-81 - Catherine H. Gebotys, Robert J. Gebotys:
Secure Elliptic Curve Implementations: An Analysis of Resistance to Power-Attacks in a DSP Processor. CHES 2002: 114-128 - Jovan Dj. Golic, Christophe Tymen:
Multiplicative Masking and Power Analysis of AES. CHES 2002: 198-212 - Shay Gueron:
Enhanced Montgomery Multiplication. CHES 2002: 46-56 - Nils Gura, Sheueling Chang Shantz, Hans Eberle, Sumit Gupta, Vipul Gupta, Daniel F. Finchelstein, Edouard Goupy, Douglas Stebila:
An End-to-End Systems Approach to Elliptic Curve Cryptography. CHES 2002: 349-365 - Adnan Abdul-Aziz Gutub, Alexandre F. Tenca, Erkay Savas, Çetin Kaya Koç:
Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2). CHES 2002: 484-499 - JaeCheol Ha, Sang-Jae Moon:
Randomized Signed-Scalar Multiplication of ECC to Resist Power Attacks. CHES 2002: 551-563 - Andrew Shane Huang:
Keeping Secrets in Hardware: The Microsoft Xbox™ Case Study. CHES 2002: 213-227 - Kouichi Itoh, Tetsuya Izu, Masahiko Takenaka:
Address-Bit Differential Power Analysis of Cryptographic Schemes OK-ECDH and OK-ECDSA. CHES 2002: 129-143 - Kouichi Itoh, Jun Yajima, Masahiko Takenaka, Naoya Torii:
DPA Countermeasures by Improving the Window Method. CHES 2002: 303-317 - Marc Joye, Sung-Ming Yen:
The Montgomery Powering Ladder. CHES 2002: 291-302 - Vlastimil Klíma, Tomás Rosa:
Further Results and Considerations on Side Channel Attacks on RSA. CHES 2002: 244-259 - Alexander Klimov, Adi Shamir:
A New Class of Invertible Mappings. CHES 2002: 470-483 - Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis:
On the Efficient Generation of Elliptic Curves over Prime Fields. CHES 2002: 333-348 - Róbert Lórencz:
New Algorithm for Classical Modular Inverse. CHES 2002: 57-70 - Adrian K. Lutz, Jürg Treichler, Frank K. Gürkaynak, Hubert Kaeslin, Gérard Basler, Antonia Erni, Stephan Reichmuth, Pieter Rommens, Stephan Oetiker, Wolfgang Fichtner:
2Gbit/s Hardware Realizations of RIJNDAEL and SERPENT: A Comparative Analysis. CHES 2002: 144-158 - Sumio Morioka, Akashi Satoh:
An Optimized S-Box Circuit Architecture for Low Power AES Design. CHES 2002: 172-186 - Katsuyuki Okeya, Kouichi Sakurai:
Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy Using Montgomery Trick. CHES 2002: 564-578 - Elisabeth Oswald:
Enhancing Simple Power-Analysis Attacks on Elliptic Curve Cryptosystems. CHES 2002: 82-97
skipping 14 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 04:46 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