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
[1]
Hilfe
Suche: Author="Imai, Hideki"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Internal state recovery of keystream generator LILI-128 based on a novel weakness of the employed Boolean function
Miodrag J. Mihaljević
,
Sugata Gangopadhyay
,
Goutam Paul
,
Hideki Imai
Information Processing Letters
112
(21), 2012, pp. 805-810
Efficient constructions of deterministic encryption from hybrid encryption and code-based PKE
Yang Cui
,
Kirill Morozov
,
Kazukuni Kobara
,
Hideki Imai
Lecture Notes in Computer Science
5527
, 2009, pp. 159-168
Bounds on the number of users for random 2-secure codes
Manabu Hagiwara
,
Takahiro Yoshida
,
Hideki Imai
Lecture Notes in Computer Science
5527
, 2009, pp. 239-242
Very-efficient anonymous password-authenticated key exchange and its extensions
SeongHan Shin
,
Kazukuni Kobara
,
Hideki Imai
Lecture Notes in Computer Science
5527
, 2009, pp. 149-158
An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths
Koji Nuida
,
Satoshi Fujitsu
,
Manabu Hagiwara
,
Takashi Kitagawa
,
Hajime Watanabe
,
Kazuto Ogawa
,
Hideki Imai
Lecture Notes in Computer Science
4851
, 2007, pp. 80-89
On the key-privacy issue of McEliece public-key encryption
Shigenori Yamakawa
,
Yang Cui
,
Kazukuni Kobara
,
Manabu Hagiwara
,
Hideki Imai
Lecture Notes in Computer Science
4851
, 2007, pp. 168-177
Low-floor Tanner codes via Hamming-Node or RSCC-node doping
Shadi Abu-Surra
,
Gianluigi Liva
,
William E. Ryan
Lecture Notes in Computer Science
3857
, 2006, pp. 245-254
A genetic algorithm for cocyclic Hadamard matrices
V. Álvarez
,
J.A. Armario
,
M.D. Frau
,
P. Real
Lecture Notes in Computer Science
3857
, 2006, pp. 144-153
A general framework for applying FGLM techniques to linear codes
M. Borges-Quintana
,
M.A. Borges-Trenard
,
E. Martínez-Moro
Lecture Notes in Computer Science
3857
, 2006, pp. 76-86
On bent and highly nonlinear balanced/resilient functions and their algebraic immunities
Claude Carlet
Lecture Notes in Computer Science
3857
, 2006, pp. 1-28
A class of fermat curves for which Weil-Serre's bound can be improved
Francis N. Castro
,
Ernesto Gomez
,
Oscar Moreno
Lecture Notes in Computer Science
3857
, 2006, pp. 128-135
Complementary sets and Reed-Muller codes for peak-to-average power ratio reduction in OFDM
Chao-Yu Chen
,
Chung-Hsuan Wang
,
Chi-chao Chao
Lecture Notes in Computer Science
3857
, 2006, pp. 317-327
On constructing AG codes without basis functions for Riemann-Roch spaces
Drue Coles
Lecture Notes in Computer Science
3857
, 2006, pp. 108-117
On achieving chosen ciphertext security with decryption errors
Yang Cui
,
Kazukuni Kobara
,
Hideki Imai
Lecture Notes in Computer Science
3857
, 2006, pp. 173-182
Computing Gröbner bases for vanishing ideals of finite sets of points
Jeffrey B. Farr
,
Shuhong Gao
Lecture Notes in Computer Science
3857
, 2006, pp. 118-127
An efficient compiler from
\Sigma
-protocol to 2-move deniable zero-knowledge
Jun Furukawa
,
Kaoru Kurosawa
,
Hideki Imai
Lecture Notes in Computer Science
4052
, 2006, pp. 46-57
On the Feng-Rao bound for generalized Hamming weights
Olav Geil
,
Christian Thommesen
Lecture Notes in Computer Science
3857
, 2006, pp. 295-306
A short random fingerprinting code against a small number of pirates
Manabu Hagiwara
,
Goichiro Hanaoka
,
Hideki Imai
Lecture Notes in Computer Science
3857
, 2006, pp. 193-202
Unconditionally secure chaffing-and-winnowing: A relationship between encryption and authentication
Goichiro Hanaoka
,
Yumiko Hanaoka
,
Manabu Hagiwara
,
Hajime Watanabe
,
Hideki Imai
Lecture Notes in Computer Science
3857
, 2006, pp. 154-162
The merit factor problem for binary sequences
Tom Hholdt
Lecture Notes in Computer Science
3857
, 2006, pp. 51-59
A theory of highly nonlinear functions
K.J. Horadam
Lecture Notes in Computer Science
3857
, 2006, pp. 87-100
LDPC codes for fading channels: Two strategies
Xiaowei Jin
,
Teng Li
,
Thomas E. Fuja
,
Oliver M. Collins
Lecture Notes in Computer Science
3857
, 2006, pp. 235-244
Long extended BCH codes are spanned by minimum weight words
Tali Kaufman
,
Simon Litsyn
Lecture Notes in Computer Science
3857
, 2006, pp. 285-294
New constructions of quasi-cyclic LDPC codes based on two classes of balanced incomplete block designs: For AWGN and binary erasure channels
Lan Lan
,
Ying Yu Tai
,
Shu Lin
,
Behshad Memari
,
Bahram Honary
Lecture Notes in Computer Science
3857
, 2006, pp. 275-284
Algebraic constructions of quasi-cyclic LDPC codes - Part I: For AWGN and binary random erasure channels
Lan Lan
,
Lingqi Zeng
,
Ying Y. Tai
,
Lei Chen
,
Shu Lin
,
Khaled Abdel-Ghaffar
Lecture Notes in Computer Science
3857
, 2006, pp. 255-264
Seiten 1
2
3
4
5
>