<--- Back to Details
First PageDocument Content
Computational hardness assumptions / Finite fields / Decisional Diffie–Hellman assumption / Diffie–Hellman problem / Vector space / Matrix / Kalman filter / Principal component analysis / Algebra / Mathematics / Cryptography
Date: 2015-04-20 07:04:42
Computational hardness assumptions
Finite fields
Decisional Diffie–Hellman assumption
Diffie–Hellman problem
Vector space
Matrix
Kalman filter
Principal component analysis
Algebra
Mathematics
Cryptography

Matrix Computational Assumptions in Multilinear Groups Paz Morillo1 , Carla R`afols2 , and Jorge L. Villar1? 1 2

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 555,58 KB

Share Document on Facebook

Similar Documents

Principal Component Analysis on non-Gaussian Dependent Data  Fang Han Johns Hopkins University, 615 N.Wolfe Street, Baltimore, MDUSA Han Liu Princeton University, 98 Charlton Street, Princeton, NJUSA

Principal Component Analysis on non-Gaussian Dependent Data Fang Han Johns Hopkins University, 615 N.Wolfe Street, Baltimore, MDUSA Han Liu Princeton University, 98 Charlton Street, Princeton, NJUSA

DocID: 1vdC9 - View Document

Generalized Principal Component Analysis (GPCA)∗ Ren´e Vidal† Yi Ma‡ Shankar Sastry† † Department of EECS, University of California, Berkeley, CA 94720

Generalized Principal Component Analysis (GPCA)∗ Ren´e Vidal† Yi Ma‡ Shankar Sastry† † Department of EECS, University of California, Berkeley, CA 94720

DocID: 1uYRE - View Document

A. Krisciukaitis et al.: Efficiency Evaluation of Autonomic Heart Control by Using the Principal Component Analysis of ECG P-Wave, en 9 en9  Efficiency Evaluation of Autonomic Heart Control by Using

A. Krisciukaitis et al.: Efficiency Evaluation of Autonomic Heart Control by Using the Principal Component Analysis of ECG P-Wave, en 9 en9 Efficiency Evaluation of Autonomic Heart Control by Using

DocID: 1tOkO - View Document

Full Regularization Path for Sparse Principal Component Analysis Alexandre d’Aspremont, Francis Bach & Laurent El Ghaoui, Princeton University, INRIA/ENS Ulm & U.C. Berkeley  Support from NSF, DHS and Google.

Full Regularization Path for Sparse Principal Component Analysis Alexandre d’Aspremont, Francis Bach & Laurent El Ghaoui, Princeton University, INRIA/ENS Ulm & U.C. Berkeley Support from NSF, DHS and Google.

DocID: 1tMMK - View Document

Binary Principal Component Analysis in the Netflix Collaborative Filtering Task

Binary Principal Component Analysis in the Netflix Collaborative Filtering Task

DocID: 1tMJC - View Document