default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th IMA 2007: Cirencester, UK
- Steven D. Galbraith:
Cryptography and Coding, 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings. Lecture Notes in Computer Science 4887, Springer 2007, ISBN 978-3-540-77271-2
Invited Papers
- Jonathan Katz:
Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise. 1-15 - Patrick Solé, Dmitrii V. Zinoviev:
Galois Rings and Pseudo-random Sequences. 16-33
Signatures I
- Laurie Law, Brian J. Matt:
Finding Invalid Signatures in Pairing-Based Batches. 34-53 - Tetsuya Izu, Takeshi Shimoyama, Masahiko Takenaka:
How to Forge a Time-Stamp Which Adobe's Acrobat Accepts. 54-72
Boolean Functions
- Nicholas Kolokotronis
, Konstantinos Limniotis, Nicholas Kalouptsidis:
Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions. 73-91 - Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
On the Walsh Spectrum of a New APN Function. 92-98 - Juan M. Estévez-Tapiador, John A. Clark, Julio César Hernández Castro:
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes. 99-117
Block Cipher Cryptanalysis
- Chris J. Mitchell:
Cryptanalysis of the EPBC Authenticated Encryption Mode. 118-128 - Gregory V. Bard:
Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption. 129-151 - Nicolas T. Courtois, Gregory V. Bard:
Algebraic Cryptanalysis of the Data Encryption Standard. 152-169
Side Channels
- Philipp Grabher, Johann Großschädl, Dan Page:
Cryptographic Side-Channels from Low-Power Cache Memory. 170-184 - Onur Aciiçmez, Shay Gueron, Jean-Pierre Seifert:
New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures. 185-203
Linear Complexity
- Panagiotis Rizomiliotis:
Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity. 204-219 - Alexandra Alecu, Ana Salagean:
Modified Berlekamp-Massey Algorithm for Approximating the k -Error Linear Complexity of Binary Sequences. 220-232
Public Key Encryption
- Tor E. Bjørstad, Alexander W. Dent, Nigel P. Smart:
Efficient KEMs with Partial Message Recovery. 233-256 - Manuel Barbosa, Pooya Farshim:
Randomness Reuse: Extensions and Improvements. 257-276 - M. Choudary Gorantla, Colin Boyd, Juan Manuel González Nieto:
On the Connection Between Signcryption and One-Pass Key Establishment. 277-301
Curves
- Seiichi Matsuda, Naoki Kanayama, Florian Hess, Eiji Okamoto:
Optimised Versions of the Ate and Twisted Ate Pairings. 302-312 - Reza Rezaeian Farashahi:
Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic. 313-335 - Waldyr D. Benits Junior, Steven D. Galbraith:
Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction. 336-345
RSA Implementation
- Kamel Bentahar, Nigel P. Smart:
Efficient 15, 360-bit RSA Using Woop-Optimised Montgomery Arithmetic. 346-363 - Andrew Moss, Dan Page, Nigel P. Smart:
Toward Acceleration of RSA Using 3D Graphics Hardware. 364-383
Signatures II
- Hoon Wei Lim, Kenneth G. Paterson:
Multi-key Hierarchical Identity-Based Signatures. 384-402 - Raylin Tso, Juan Manuel González Nieto, Takeshi Okamoto, Colin Boyd, Eiji Okamoto:
Verifier-Key-Flexible Universal Designated-Verifier Signatures. 403-421
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.
last updated on 2026-05-12 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
