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 26 matches
- 2014
- N. Nalla Anandakumar, Thomas Peyrin, Axel Poschmann:
A Very Compact FPGA Implementation of LED and PHOTON. INDOCRYPT 2014: 304-321 - Subhadeep Banik, Anupam Chattopadhyay, Anusha Chowdhury:
Cryptanalysis of the Double-Feedback XOR-Chain Scheme Proposed in Indocrypt 2013. INDOCRYPT 2014: 179-196 - Lejla Batina, Lukasz Chmielewski, Louiza Papachristodoulou, Peter Schwabe, Michael Tunstall:
Online Template Attacks. INDOCRYPT 2014: 21-36 - Lejla Batina, Domagoj Jakobovic, Nele Mentens, Stjepan Picek, Antonio de la Piedra, Dominik Sisejkovic:
S-box Pipelining Using Genetic Algorithms for High-Throughput AES Implementations: How Fast Can We Go? INDOCRYPT 2014: 322-337 - Jean-François Biasse, David Jao, Anirudh Sankar:
A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves. INDOCRYPT 2014: 428-442 - Nishanth Chandran, Sanjam Garg:
Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions. INDOCRYPT 2014: 89-103 - Michael Colburn, Liam Keliher:
Linear Cryptanalysis of the PP-1 and PP-2 Block Ciphers. INDOCRYPT 2014: 107-123 - Prakash Dey, Avishek Adhikari:
Improved Multi-Bit Differential Fault Analysis of Trivium. INDOCRYPT 2014: 37-52 - Benoit Feix, Mylène Roussellet, Alexandre Venelli:
Side-Channel Analysis on Blinded Regular Scalar Multiplications. INDOCRYPT 2014: 3-20 - Benoit Feix, Hugues Thiebeauld, Lucille Tordella:
Recovering CRT-RSA Secret Keys from Message Reduced Values with Side-Channel Analysis. INDOCRYPT 2014: 53-67 - Steven D. Galbraith, Shishay W. Gebregiyorgis:
Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two. INDOCRYPT 2014: 409-427 - Divya Gupta, Amit Sahai:
On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption. INDOCRYPT 2014: 71-88 - Jialin Huang, Serge Vaudenay, Xuejia Lai:
On the Key Schedule of Lightweight Block Ciphers. INDOCRYPT 2014: 124-142 - Ayesha Khalid, Prasanna Ravi, Anupam Chattopadhyay, Goutam Paul:
One Word/Cycle HC-128 Accelerator via State-Splitting Optimization. INDOCRYPT 2014: 283-303 - Kwang Ho Kim, Chol Ok Lee, Christophe Nègre:
Binary Edwards Curves Revisited. INDOCRYPT 2014: 393-408 - Amir Moradi:
Wire-Tap Codes as Side-Channel Countermeasure - - An FPGA-Based Experiment -. INDOCRYPT 2014: 341-359 - Elena Pagnin, Christos Dimitrakakis, Aysajan Abidin, Aikaterini Mitrokotsa:
On the Leakage of Information in Biometric Authentication. INDOCRYPT 2014: 265-280 - Stjepan Picek, Kostas Papagiannopoulos, Baris Ege, Lejla Batina, Domagoj Jakobovic:
Confused by Confusion: Systematic Evaluation of DPA Resistance of Various S-boxes. INDOCRYPT 2014: 374-390 - Inna Polak, Adi Shamir:
Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions. INDOCRYPT 2014: 219-236 - Dhiman Saha, Sukhendu Kuila, Dipanwita Roy Chowdhury:
EscApe: Diagonal Fault Analysis of APE. INDOCRYPT 2014: 197-216 - Sumanta Sarkar, Subhamoy Maitra, Kaushik Chakraborty:
Differential Power Analysis in Hamming Weight Model: How to Choose among (Extended) Affine Equivalent S-boxes. INDOCRYPT 2014: 360-373 - Santanu Sarkar, Ayineedi Venkateswarlu:
Partial Key Exposure Attack on CRT-RSA. INDOCRYPT 2014: 255-264 - Qingju Wang, Zhiqiang Liu, Kerem Varici, Yu Sasaki, Vincent Rijmen, Yosuke Todo:
Cryptanalysis of Reduced-Round SIMON32 and SIMON48. INDOCRYPT 2014: 143-160 - Long Wen, Meiqin Wang, Andrey Bogdanov, Huaifeng Chen:
General Application of FFT in Cryptanalysis and Improved Attack on CAST-256. INDOCRYPT 2014: 161-176 - Chao Xu, Bin Zhang, Dengguo Feng:
Linear Cryptanalysis of FASER128/256 and TriviA-ck. INDOCRYPT 2014: 237-254 - Willi Meier, Debdeep Mukhopadhyay:
Progress in Cryptology - INDOCRYPT 2014 - 15th International Conference on Cryptology in India, New Delhi, India, December 14-17, 2014, Proceedings. Lecture Notes in Computer Science 8885, Springer 2014, ISBN 978-3-319-13038-5 [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-10-21 05: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