Cryptography Reference
In-Depth Information
[BF97]
D. Boneh and M. Franklin. Efficient generation of
shared RSA keys.
Lecture Notes in Computer Science,
CRYPTO 97
, 1294:425-??, 1997.
[BFHMV84] I.F. Blake, R. Fuji-Hara, R.C. Mullin, and S.A. Vanstone.
Computing logarithms in finite fields of characteristic
two.
SIAM Journal on Algebraic Discrete Methods
,5,
1984.
[BG07]
Nikita Borisov and Philippe Golle, editors.
Privacy
Enhancing Technologies, 7th International Symposium,
PET 2007 Ottawa, Canada, June 20-22, 2007, Revised Se-
lected Papers
, volume 4776 of
Lecture Notes in Computer
Science
. Springer, 2007.
[BGI
+
01]
Boaz Barak, Oded Goldreich, Russell Impagliazzo,
Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang.
On the (im)possibility of obfuscating programs. In
Pro-
ceedings of Crypto 2001, Springer Verlag LNCS Volume
2139
, 2001.
[BGML96] Walter Bender, D. Gruhl, N. Morimoto, and A. Lu. Tech-
niques for data hiding.
IBM Systems Journal
, 35(3):313,
1996.
[BH92]
M. Barnsley and L. Hurd.
Fractal Image Compression
.
AK Peters, Ltd., Wellesley, Ma., 1992.
[BJN00]
Dan Boneh, Antoine Joux, and Phong Q. Nguyen. Why
textbook elgamal and RSA encryption are insecure. In
ASIACRYPT '00: Proceedings of the 6th International
Conference on the Theory and Application of Cryptol-
ogy and Information Security
, pages 30-43, London, UK,
2000. Springer-Verlag.
[BJNW57]
F.P. Brooks, A.L Hopkins Jr., Peter G. Neumann, and W.V.
Wright. An experiment in musical composition. EC-
6(3), September 1957.
[BL85]
Charles Bennett and Rolf Landauer. The fundamen-
tal physical limits of computation.
Scientific American
,
pages 48-56, July 1985.
[BLMO94]
J Brassil, S Low, N Maxemchuk, and L O'Garman. Elec-
tronic marking and identification techniques to dis-
courage document copying. In
Proceedings of IEEE In-
focom 94
, pages 1278 - 1287, 1994.
