Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
43
views
17
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
803
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology — EUROCRYPT ’97
Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)
other
Author(s):
Christof Paar
,
Pedro Soria-Rodriguez
Publication date
(Online):
July 13 2001
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Genome Engineering using CRISPR
Most cited references
17
Record
: found
Abstract
: not found
Book
: not found
Elliptic Curve Public Key Cryptosystems
Alfred Menezes
(1993)
0
comments
Cited
66
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Hyperelliptic cryptosystems
Neal Koblitz
(1989)
0
comments
Cited
39
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Optimal normal bases in GF(pn)
R.C. Mullin
,
S.A. Vanstone
,
I.M. Onyszchuk
…
(1988)
0
comments
Cited
27
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1997
Publication date (Online):
July 13 2001
Pages
: 363-378
DOI:
10.1007/3-540-69053-0_25
SO-VID:
be1c2014-3528-4f53-8fe6-fb00e3e7df51
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Two Attacks on Reduced IDEA
pp. 14
Combinatorial Properties of Basic Encryption Operations
pp. 52
Lattice Attacks on NTRU
pp. 75
Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation
pp. 88
Anonymous Fingerprinting
pp. 119
Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals
pp. 134
The GCHQ Protocol and Its Problems
pp. 149
Bucket Hashing with a Small Key Size
pp. 163
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost
pp. 193
Smooth Entropy and Rényi Entropy
pp. 209
Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion
pp. 226
Linear Statistical Weakness of Alleged RC4 Keystream Generator
pp. 239
Cryptanalysis of Alleged A5 Stream Cipher
pp. 267
Stronger Security Proofs for RSA and Rabin Bits
pp. 280
Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function
pp. 306
Efficient Cryptographic Protocols Based on Noisy Channels
pp. 318
Rapid Demonstration of Linear Relations Connected by Boolean Operators
pp. 334
Oblivious Transfers and Privacy Amplification
pp. 348
SHA: A Design for Parallel Architectures?
pp. 363
Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)
pp. 379
Finding Good Random Elliptic Curves for Cryptosystems Defined over $$ \mathbb{F}_{{\text{2}}^n } $$
pp. 393
Incremental Cryptography and Memory Checkers
pp. 409
Almost k-wise Independent Sample Spaces and Their Cryptologic Applications
pp. 422
More Correlation-Immune and Resilient Functions over Galois Fields and Galois Rings
pp. 434
Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria
pp. 450
Distributed “Magic Ink” Signatures
pp. 465
Efficient and Generalized Group Signatures
pp. 495
Selective Forgery of RSA Signatures Using Redundancy
Similar content
803
Something new about type Normandy von Willebrand disease (type 2N VWD)?
Authors:
Claudine Mazurier
Structure of [2((CH3)2N)2PCl].AlCl3, ((CH3)2N)3P.((CH3)2N)2PCl.AlCl3, and related species-diphosphorus cations
Authors:
R. W. Parry
,
C. Schultz
Activity coefficients at infinite dilution of various solutes in the ionic liquids [MMIM]+[CH3SO4]–, [MMIM]+[CH3OC2H4SO4]–,[MMIM]+[(CH3) 2PO4]–, [C5H5NC2H5]+[(CF3SO2) 2N]– and [C5H5NH]+[C2H5OC2H4OSO3]–
Authors:
R KATO
,
J. Gmehling
See all similar
Cited by
3
Efficient Rijndael Encryption Implementation with Composite Field Arithmetic
Authors:
Atri Rudra
,
Pradeep K. Dubey
,
Charanjit Jutla
…
Efficient algorithms for elliptic curve cryptosystems
Authors:
Jorge Guajardo
,
Christof Paar
Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
Authors:
T. Kerins
,
W. P. Marnane
,
E. M. Popovici
…
See all cited by