Perpustakaan Fakultas Ilmu Komputer

Library Automation and Digital Archive

LONTAR

Fakultas Ilmu Komputer
Universitas Indonesia

Call Number	005.82 Cry
Collection Type	Indeks Artikel LNCS
Title	Computing the M=UU t integer matrix decomposition, Efficient key updating signaturn schemes based on IBS, LNCS-Lecture Notes in Computer Science 2898), Hal. 223-233
Author	Katharina Geibler and Nigel P. Smart;
Publisher	Springer, 2003
Subject
Location

Lokasi : Perpustakaan Fakultas Ilmu Komputer

Nomor Panggil	ID Koleksi	Status
005.82 Cry		TERSEDIA

Tidak ada review pada koleksi ini: 42166

The cryption of Gentry and Saydlo of the revised NTRU signature scheme requires the computation of the integer matrix decomposition M=UU1. We propose a heuristic algorithm to implementation of this algorithm in magma is able to deal with matrices up to 158 rows and colums

Latest Collection

Evaluation of Signature Files as Set Access Facilities in OODBs (247-256)

Type: Indeks Artikel prosiding/Sem

Kendali Adaptif pada Lampu Lalu Lintas Memakai Logika Fuzzy (107-111)

Type: Indeks Artikel prosiding/Sem

Efficient Processing of Spatial Joins Using R-trees (237-246)

Type: Indeks Artikel prosiding/Sem

Temporal Modules: An Approach Toward Federated Temporal Databases (227-236)

Type: Indeks Artikel prosiding/Sem

Pengatur Suhu CSDA (Compact Spray Drier Atomizer) memakai Logika Fuzzy (103-106)

Type: Indeks Artikel prosiding/Sem

Loading Data into Description Reasoners(217-226)

Type: Indeks Artikel prosiding/Sem

Pemilihan ATM (Asynchronous Tranfer Mode) Service Untuk Aplikasi-Aplikasi Di PT Caltex Pacific Indonesia. Suatu Studi Kasus (98-102)

Type: Indeks Artikel prosiding/Sem

Mining Asspciation Rules between Sets of Items in Large Databases (207-216)

Type: Indeks Artikel prosiding/Sem

Real-Time Transaction Scheduling: A COst Conscious Approach (197-206)

Type: Indeks Artikel prosiding/Sem

Analisa Kinerja Error Sistem Trellis Coded Modulation 8-PSK (93-97)

Type: Indeks Artikel prosiding/Sem

Favorite