Advances in Cryptology – EUROCRYPT '89: Workshop on the Theory and Application of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989. Proceedings: Lecture Notes in Computer Science, cartea 434
Editat de Jean-Jacques Quisquater, Joos Vandewalleen Limba Engleză Paperback – 27 noi 1990
Din seria Lecture Notes in Computer Science
- 15% Preț: 549.48 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.78 lei
- 20% Preț: 238.01 lei
- 20% Preț: 1017.66 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 548.35 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 315.19 lei
- 20% Preț: 1005.39 lei
- 20% Preț: 554.59 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 560.32 lei
- 20% Preț: 611.22 lei
- 20% Preț: 319.10 lei
- 20% Preț: 552.64 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.78 lei
- Preț: 361.23 lei
- 20% Preț: 969.58 lei
- 20% Preț: 256.27 lei
- 20% Preț: 782.28 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 722.90 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.72 lei
- 20% Preț: 550.29 lei
- Preț: 389.06 lei
- 20% Preț: 564.99 lei
- 20% Preț: 552.25 lei
- 20% Preț: 552.25 lei
- 20% Preț: 722.40 lei
- 20% Preț: 331.59 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 591.95 lei
Preț vechi: 778.88 lei
-24% Nou
Puncte Express: 888
Preț estimativ în valută:
113.32€ • 123.45$ • 95.06£
113.32€ • 123.45$ • 95.06£
Carte tipărită la comandă
Livrare economică 14-20 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540534334
ISBN-10: 3540534334
Pagini: 556
Dimensiuni: 216 x 279 x 29 mm
Greutate: 1 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540534334
Pagini: 556
Dimensiuni: 216 x 279 x 29 mm
Greutate: 1 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchDescriere
‘I’he
int,ernational
Association
for
Cryptologic
Research
(IACK)
organizes
two
inter-
tioilill
coiifcrcnces
every
year,
one
in
Europe
and
one
in
the
United
States.
EUROCRI’PT
’89
was
the
seventh
European
conference
and
was
held
in
Houthalen,
Belgium
on
April
10-13,
1989.
With
close
to
300
participants,
it
was
perhaps
the
largest
open
conferencr
on
c:rypt,ogra.phy
ever
held.
The
field
of
cryptography
is
expanding
not
only
because
of
the
increased
vulnerability
of
computer
systems
and
networks
to
a11
increasing
range
of
threats,
but
also
because
of
t1ic
ra.pid
progress
in
cryptographic
methods,
that
t,he
readers
can
witness
by
reading
the
book.
The
present
proceedings
contain
nearly
all
contributions
which
were
presented
including
the
talks
at
the
rump
session.
The
chapters
correspond
to
the
sessions
at
the
conference.
It
wa5
the
first
time
that
a
rump
session
was
organized
on
a
Eurocrypt
conference.
Sixteen
impromptu
talks
were
given,
and
the
authors
were
invited
to
submit
short
abstracts
of
their
presentations.
Because
of
the
special
character
of
this
session,
the
editors
have
taken
the
liberty
to
shorten
some
of
these.
Cuprins
Public-key
cryptosystems.-
The
Adolescence
of
Public-Key
Cryptography.-
A
Secure
Public-Key
Authentication
Scheme.-
How
to
improve
signature
schemes.-
A
Generalization
of
El
Gamal’s
Public
Key
Cryptosystem.-
An
Identity-Based
Key-Exchange
Protocol.-
How
to
Keep
Authenticity
Alive
in
a
Computer
Network.-
The
Use
of
Fractions
in
Public-Key
Cryptosystems.-
A
Practical
Protocol
for
Large
Group
Oriented
Networks.-
Theory.-
Counting
Functions
Satisfying
a
Higher
Order
Strict
Avalanche
Criterion.-
A
Key
Distribution
System
Based
On
Any
One-Way
Function.-
Non-linearity
of
Exponent
Permutations.-
Informational
Divergence
Bounds
for
Authentication
Codes.-
2n-Bit
Hash-Functions
Using
n-Bit
Symmetric
Block
Cipher
Algorithms.-
A
Simple
Technique
for
Diffusing
Cryptoperiods.-
Zero-knowledge
protocols.-
A
General
Zero-Knowledge
Scheme.-
Divertible
Zero
Knowledge
Interactive
Proofs
and
Commutative
Random
Self-Reducibility.-
Verifiable
Disclosure
of
Secrets
and
Applications
(Abstract).-
Practical
Zero-Knowledge
Proofs:
Giving
Hints
and
Using
Deficiencies.-
An
alternative
to
the
Fiat-Shamir
protocol.-
Sorting
out
zero-knowledge.-
Everything
in
NP
can
be
argued
in
perfect
zero-knowledge
in
a
bounded
number
of
rounds.-
Zero-Knowledge
Proofs
of
Computational
Power.-
More
Efficient
Match-Making
and
Satisfiability
The
Five
Card
Trick.-
Applications.-
A
Single
Chip
1024
Bits
RSA
Processor.-
Cryptel
-
The
Practical
Protection
of
an
Existing
Electronic
Mail
System.-
Technical
Security:
The
Starting
Point.-
Security
in
Open
Distributed
Processing.-
A
European
Call
for
Cryptographic
Algorithms:
Ripe;
Race
Integrity
Primitives
Evaluation.-
Signature
and
untraceability.-
Legal
Requirements
Facing
New
Signature
Technology.-
Online
Cash
Checks.-
Efficient
Offline
Electronic
Checks.-
Unconditional
Sender
and
Recipient
Untraceability
in
Spite
of
Active
Attacks.-
Detection
of
Disrupters
in
the
DC
Protocol.-
Cryptanalysis.-
Random
Mapping
Statistics.-
Factoring
by
electronic
mail.-
Cryptanalysis
of
Short
RSA
Secret
Exponents.-
How
to
Break
the
Direct
RSA-Implementation
of
Mixes.-
An
Information-Theoretic
Treatment
of
Homophonic
Substitution.-
Cryptanalysis
of
a
Modified
Rotor
Machine.-
Cryptanalysis
of
Video
Encryption
Based
on
Space-Filling
Curves.-
Impossibility
and
Optimality
Results
on
Constructing
Pseudorandom
Permutations.-
On
the
Security
of
Schnorr’s
Pseudo
Random
Generator.-
How
easy
is
collision
search?
Application
to
DES.-
Sharing
and
authentication
schemes.-
Prepositioned
Shared
Secret
and/or
Shared
Control
Schemes.-
Some
Ideal
Secret
Sharing
Schemes.-
Cartesian
Authentication
Schemes.-
How
to
Say
“No”.-
Key
Minimal
Authentication
Systems
for
Unconditional
Secrecy.-
Sequences.-
Parallel
Generation
of
Recurring
Sequences.-
Keystream
Sequences
with
a
Good
Linear
Complexity
Profile
for
Every
Starting
Point.-
On
the
Complexity
of
Pseudo-Random
Sequences
-
or:
If
You
Can
Describe
a
Sequence
It
Can’t
be
Random.-
Feedforward
Functions
Defined
by
de
Bruijn
Sequences.-
Nonlinearity
Criteria
for
Cryptographic
Functions.-
On
the
Linear
Complexity
of
Feedback
Registers.-
Linear
Complexity
Profiles
and
Continued
Fractions.-
A
Fast
Correlation
Attack
on
Nonlinearly
Feedforward
Filtered
Shift-Register
Sequences.-
Algorithms.-
On
the
Complexity
and
Efficiency
of
a
New
Key
Exchange
System.-
A
New
Multiple
Key
Cipher
and
an
Improved
Voting
Scheme.-
Atkin’s
Test:
News
from
the
Front.-
Fast
Generation
of
Secure
RSA-Moduli
with
Almost
Maximal
Diversity.-
Old
problems.-
Deciphering
Bronze
Age
Scripts
of
Crete
The
Case
of
Linear
A.-
Rump
Session
(impromptu
talks).-
Faster
Primality
Testing.-
Private-Key
Algebraic-Code
Cryptosystems
with
High
Information
Rates.-
Zero-knowledge
procedures
for
confidential
access
to
medical
records.-
Full
Secure
Key
Exchange
and
Authentication
with
no
Previously
Shared
Secrets.-
Varying
Feedback
Shift
Registers.-
A
Cryptanalysis
of
Stepk,m-Cascades.-
Efficient
Identification
and
Signatures
for
Smart
Cards.-
The
Dining
Cryptographers
in
the
Disco:
Unconditional
Sender
and
Recipient
Untraceability
with
Computationally
Secure
Serviceability.-
Some
Conditions
on
the
Linear
Complexity
Profiles
of
Certain
Binary
Sequences.-
On
the
Design
of
Permutation
P
in
des
Type
Cryptosystems.-
A
Fast
Elliptic
Curve
Cryptosystem.