Cryptography and coding : 11th IMA international conference, Cirencester, UK, December 18-20, 2007 ; proceedings (Englisch)
- Neue Suche nach: International Conference on Cryptography and Coding
- Weitere Informationen zu International Conference on Cryptography and Coding:
- http://d-nb.info/gnd/6069454-3
- Neue Suche nach: Galbraith, Steven D.
- Weitere Informationen zu Galbraith, Steven D.:
- http://d-nb.info/gnd/121893928
- Neue Suche nach: International Conference on Cryptography and Coding
- Weitere Informationen zu International Conference on Cryptography and Coding:
- http://d-nb.info/gnd/6069454-3
2007
-
ISBN:
- Konferenzband / Print
-
Titel:Cryptography and coding : 11th IMA international conference, Cirencester, UK, December 18-20, 2007 ; proceedings
-
Beteiligte:Galbraith, Steven D. ( Herausgeber:in ) / International Conference on Cryptography and Coding
-
Kongress:International Conference on Cryptography and Coding ; 11 ; 2007 ; Cirencester
IMA International Conference on Cryptography and Coding ; 11 ; 2007 ; Cirencester -
Erschienen in:
-
Verlag:
- Neue Suche nach: Springer
-
Erscheinungsort:Berlin , Heidelberg [u.a.]
-
Erscheinungsdatum:2007
-
Format / Umfang:XI, 421 S.
-
Anmerkungen:235 mm x 155 mm
graph. Darst.
Literaturangaben
Langzeitarchivierung durch Badische Landesbibliothek -
ISBN:
-
Medientyp:Konferenzband
-
Format:Print
-
Sprache:Englisch
- Neue Suche nach: 31.14 / 31.12 / 54.62
- Weitere Informationen zu Basisklassifikation
- Neue Suche nach: *94-06 / 00B25 / 94A60
- Weitere Informationen zu Mathematics Subject Classification
-
Schlagwörter:
-
Klassifikation:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with NoiseKatz, J. et al. | 2007
- 16
-
Galois Rings and Pseudo-random SequencesSole, P. / Zinoviev, D. et al. | 2007
- 34
-
Finding Invalid Signatures in Pairing-Based BatchesLaw, L. / Matt, B.J. et al. | 2007
- 54
-
How to Forge a Time-Stamp Which Adobe's Acrobat AcceptsIzu, T. / Shimoyama, T. / Takenaka, M. et al. | 2007
- 73
-
Efficient Computation of the Best Quadratic Approximations of Cubic Boolean FunctionsKolokotronis, N. / Limniotis, K. / Kalouptsidis, N. et al. | 2007
- 92
-
On the Walsh Spectrum of a New APN FunctionBracken, C. / Byrne, E. / Markin, N. / McGuire, G. et al. | 2007
- 99
-
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-BoxesTapiador, J.M.E. / Clark, J.A. / Hernandez-Castro, J.C. et al. | 2007
- 118
-
Cryptanalysis of the EPBC Authenticated Encryption ModeMitchell, C.J. et al. | 2007
- 129
-
Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of EncryptionBard, G.V. et al. | 2007
- 152
-
Algebraic Cryptanalysis of the Data Encryption StandardCourtois, N.T. / Bard, G.V. et al. | 2007
- 170
-
Cryptographic Side-Channels from Low Power Cache MemoryGrabher, P. / Grossschadl, J. / Page, D. et al. | 2007
- 185
-
New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software CountermeasuresAciicmez, O. / Gueron, S. / Seifert, J.-P. et al. | 2007
- 204
-
Remarks on the New Attack on the Filter Generator and the Role of High Order ComplexityRizomiliotis, P. et al. | 2007
- 220
-
Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary SequencesAlecu, A. / Salagean, A. et al. | 2007
- 233
-
Efficient KEMs with Partial Message RecoveryBjorstad, T.E. / Dent, A.W. / Smart, N.P. et al. | 2007
- 257
-
Randomness Reuse:Extensions and ImprovementsBarbosa, M. / Farshim, P. et al. | 2007
- 277
-
On the Connection Between Signcryption and One-Pass Key EstablishmentGorantla, M.C. / Boyd, C. / Nieto, J.M.G. et al. | 2007
- 302
-
Optimised Versions of the Ate and Twisted Ate PairingsMatsuda, S. / Kanayama, N. / Hess, F. / Okamoto, E. et al. | 2007
- 313
-
Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd CharacteristicFarashahi, R.R. et al. | 2007
- 336
-
Constructing Pairing-Friendly Elliptic Curves Using Grobner Basis ReductionJunior, W.D.B. / Galbraith, S.D. et al. | 2007
- 346
-
Efficient 15,360-bit RSA Using Woop-Optimised Montgomery ArithmeticBentahar, K. / Smart, N.P. et al. | 2007
- 364
-
Toward Acceleration of RSA Using 3D Graphics HardwareMoss, A. / Page, D. / Smart, N.P. et al. | 2007
- 384
-
Multi-key Hierarchical Identity-Based SignaturesLim, H.W. / Paterson, K.G. et al. | 2007
- 403
-
Verifier-Key-Flexible Universal Designated-Verifier SignaturesTso, R. / Nieto, J.M.G. / Okamoto, T. / Boyd, C. / Okamoto, E. et al. | 2007