Welcome, Guest.Sign in for full access to IOU Digital Library's resources.

Welcome to IOU Digital Library

Refine your Search

Useful Links

Page 1 | Results on this page: 10 | Digital Books: 12 | Physical Books: 0

An efficient pseudo-random generator provably as secure as syndrome decoding
An efficient pseudo-random generator provably as secure as syndrome decoding

Subjects: Advances in Cryptology - EuroCrypt '96,  Lecture Notes in Computer Science Volume 1070,  codes,  syndrome decoding,  pseudo-random number generator

Published in: 101

Availability: 1 of 1(eBook)

By: Fischer ,  J. B.

Construction of t-resilient functions over a finite alphabet
Construction of t-resilient functions over a finite alphabet

Subjects: Advances in Cryptology - EuroCrypt '96,  Lecture Notes in Computer Science Volume 1070,  correlation immunity ,  resilient functions

Published in: 101

Availability: 1 of 1(eBook)

By: Camion ,  P.

Designated verifier proofs and their applications
Designated verifier proofs and their applications

Subjects: Advances in Cryptology - EuroCrypt '96,  Lecture Notes in Computer Science Volume 1070,  designated verifier proofs,  trapdoor commitments,  zero knowledge

Published in: 101

Availability: 1 of 1(eBook)

By: Jakobsson ,  M. ,  Sako ,  K.

Efficient multiplicative sharing schemes
Efficient multiplicative sharing schemes

Subjects: Advances in Cryptology - EuroCrypt '96,  Lecture Notes in Computer Science Volume 1070,  secret sharing ,  threshold cryptosystems

Published in: 101

Availability: 1 of 1(eBook)

By: Blackburn ,  S. R. ,  Burmester ,  M. V. D. ,  Desmedt ,  Y.

Equivocable oblivious transfer
Equivocable oblivious transfer

Subjects: Advances in Cryptology - EuroCrypt '96,  Lecture Notes in Computer Science Volume 1070,  oblivious transfer

Published in: 101

Availability: 1 of 1(eBook)

By: Beaver ,  D.

Fast low order approximation of cryptographic functions
Fast low order approximation of cryptographic functions

Subjects: Advances in Cryptology - EuroCrypt '96,  Lecture Notes in Computer Science Volume 1070,  approximation attacks,  boolean functions,  filter generators

Published in: 101

Availability: 1 of 1(eBook)

By: Golic ,  J. D.

Finding a small root of a bivariate integer equation; factoring with high bits known
Finding a small root of a bivariate integer equation; factoring with high bits known

Subjects: Advances in Cryptology - EuroCrypt '96,  Lecture Notes in Computer Science Volume 1070,  bit security,  of Rabin and RSA schemes,  RSA,  low exponent attacks

Published in: 101

Availability: 1 of 1(eBook)

By: Coppersmith ,  D.

Finding a small root of a univariate modular equation
Finding a small root of a univariate modular equation

Subjects: Advances in Cryptology - EuroCrypt '96,  Lecture Notes in Computer Science Volume 1070,  low exponent attacks,  RSA

Published in: 101

Availability: 1 of 1(eBook)

By: Coppersmith ,  D.

Foiling birthday attacks in length-doubling transformations
Foiling birthday attacks in length-doubling transformations

Subjects: Advances in Cryptology - EuroCrypt '96,  Lecture Notes in Computer Science Volume 1070,  Benes network,  birthday attack,  Feistel cipher,  Luby-Rackoff block cipher

Published in: 101

Availability: 1 of 1(eBook)

By: Aiello ,  W.

Generating ElGamal signatures without knowing the secret key
Generating ElGamal signatures without knowing the secret key

Subjects: Advances in Cryptology - EuroCrypt '96,  Lecture Notes in Computer Science Volume 1070,  ElGamal signature scheme

Published in: 101

Availability: 1 of 1(eBook)

By: Bleichenbacher ,  D.

Fresh Arrivals