Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Comput. AND Volume=151
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Function field sieve method for discrete logarithms over finite fields
Leonard M. Adleman
,
Ming-Deh A. Huang
Information and Computation
151
(1-2), 1999, pp. 5-16
A lattice-based public-key cryptosystem
Jin-Yi Cai
,
Thomas W. Cusick
Information and Computation
151
(1-2), 1999, pp. 17-31
On cryptographic propagation criteria for Boolean functions
Claude Carlet
Information and Computation
151
(1-2), 1999, pp. 32-56
Almost perfect nonlinear power functions on
GF(2^n)
: The Niho case
Hans Dobbertin
Information and Computation
151
(1-2), 1999, pp. 57-72
Binary sequences of period
2^m-1
with large linear complexity
T. Helleseth
,
H.M. Martinsen
Information and Computation
151
(1-2), 1999, pp. 73-91
Some computational problems of cryptographic significance concerning elliptic curves over rings
Ming-Deh A. Huang
,
Chaoping Xing
Information and Computation
151
(1-2), 1999, pp. 92-99
Further results on asymmetric authentication schemes
Thomas Johansson
Information and Computation
151
(1-2), 1999, pp. 100-133
An algorithm for the
k
-error linear complexity of sequences over
GF(p^m)
with period
p^n
,
p
a prime
Takayasu Kaida
,
Satoshi Uehara
,
Kyoki Imamura
Information and Computation
151
(1-2), 1999, pp. 134-147
Multireceiver authentication codes: Models, bounds, constructions, and extensions
R. Safavi-Naini
,
H. Wang
Information and Computation
151
(1-2), 1999, pp. 148-172