Publicly Verifiable Delegation of Matrix Operation

2015 ◽  
Author(s):  
Lu Chen ◽  
Yan-Qin Zhu
Keyword(s):  
Matrix Operation

CPU AND GPU PERFORMANCE ANALYSIS ON 2D MATRIX OPERATION

2021 ◽  
Vol 2 (1) ◽  
pp. 1
Author(s):  
Kwek Benny Kurniawan ◽  
YB Dwi Setianto
Keyword(s):  
Graphic Processing Unit ◽  
Computing Time ◽  
General Purpose ◽  
Parallel Processors ◽  
Processing Unit ◽  
Matrix Operation ◽  
Industry Standard ◽  
Programming Interfaces ◽  
Complete Matrix ◽  
Matrix Calculation

GPU or Graphic Processing Unit can be used on many platforms in general GPUs are used for rendering graphics but now GPUs are general purpose parallel processors with support for easily accessible programming interfaces and industry standard languages such as C, Python and Fortran. In this study, the authors will compare CPU and GPU for completing some matrix calculation. To compare between CPU and GPU, the authors have done some testing to observe the use of Processing Unit, memory and computing time to complete matrix calculations by changing matrix sizes and dimensions. The results of tests that have been done shows asynchronous GPU is faster than sequential. Furthermore, thread for GPU needs to be adjusted to achieve efficiency in GPU load.

scholarly journals DIVERSITY AES IN MIXCOLUMNS STEP WITH 8X8 CIRCULANT MATRIX

2021 ◽  
Vol 8 (9) ◽  
pp. 19-35
Author(s):  
Yan-Wen Chen ◽  
Jeng-Jung Wang ◽  
Yan-Haw Chen ◽  
Chong-Dao Lee
Keyword(s):  
Embedded Systems ◽  
Efficient Method ◽  
Matrix Multiplication ◽  
Circulant Matrix ◽  
Circulant Matrices ◽  
Matrix Operation ◽  
Branch Number ◽  
Involutory Matrix ◽  
Software Implementations ◽  
Encryption Decryption

In AES MixColumns operation, the branch number of circulant matrix is raised from 5 to 9 with 8´8 circulant matrices that can be enhancing the diffusion power. An efficient method to compute the circulant matrices in AES MixColumns transformation for speeding encryption is presented. Utilizing 8´8 involutory matrix multiplication is required 64 multiplications and 56 additions in in AES Mix-Columns transformation. We proposed the method with diversity 8´8 circulant matrices is only needed 19 multiplications and 57 additions. It is not only to encryption operations but also to decryption operations. Therefore, 8´8 circlant matrix operation with AES key sizes of 128bits, 192bits, and 256 bits are above 29.1%, 29.3%, and 29.8% faster than using 4´4 involutory matrix operation (16 multiplications, 12 additions), respectively. 8´8 circulant matrix encryption/decryption speed is above 78% faster than 8´8 involutory matrix operation. Ultimately, the proposed method for evaluating matrix multiplication can be made regular, simple and suitable for software implementations on embedded systems.

Biquad-parametric technique for digital filter design using bilinear pascal matrix operation

2008 ◽  
Author(s):  
Jetsarawoot Kreuakum ◽  
Sorawat Chivapreecha ◽  
Somyot Junnapiya ◽  
Naohiko Shimizu ◽  
Kobchai Dejhan
Keyword(s):  
Digital Filter ◽  
Filter Design ◽  
Matrix Operation ◽  
Digital Filter Design ◽  
Pascal Matrix

A Color Image Watermarking Algorithm

2013 ◽  
Vol 798-799 ◽  
pp. 733-736
Author(s):  
Xiu Hu Tan
Keyword(s):  
Color Image ◽  
Image Watermarking ◽  
False Alarm Probability ◽  
Reference Image ◽  
Secret Key ◽  
Color Image Watermarking ◽  
Matrix Operation ◽  
The Public ◽  
Color Features ◽  
Watermarking Scheme

Transparency and robustness are two conflicting requirements demanded by digital image watermarking for copyright protection and many other purposes. In this paper, a robust and transparent watermarking scheme for color images is proposed. The color features for the human visual system are utilized to design the color watermarking algorithm. The basic idea is to embed the invisible watermark into the color image by brightness adjustment and feature component choice. And through analysis and constraint the conditions, we can obtain a high detection probability and security, a low false alarm probability. In the same time, because we use different matrix operation to embed (secret key) and extract (public key) a watermark, we are able to release all information for the public, except the secret key. Our method can extract the embedded watermark without reference image. The robustness of our method is demonstrated by various attacks through computer simulation.

A New Method of Reliability Analysis on Strength and Stiffness for Frame Structure

2010 ◽  
Vol 163-167 ◽  
pp. 3411-3414
Author(s):  
Yi Li ◽  
Bo Sun ◽  
Wen Zhao
Keyword(s):  
Reliability Analysis ◽  
Failure Modes ◽  
Recurrence Formula ◽  
Frame Structure ◽  
State Function ◽  
Matrix Operation ◽  
Variational Structure ◽  
Strength And Stiffness ◽  
Global Stiffness Matrix ◽  
New Criterion

An accelerating calculation of reliability analysis on strength and stiffness for frame structure was derived. The method of numerical analysis was combined with recurrence formula, to generatelimit state function of continual variational structure. This methodcan simplify the algorithm for identifying systemic dominant failure modes, because the repeated assembly of global stiffness matrix and repeated inverse matrix operation in analysis are avoided. A new criterion of degenerating the structure into mechanism is introduced. Continual analysis of variational structure can be realized.

A Novel Deduction of Stokes Parameters Based on 2-ordered Basis Matrices

2014 ◽  
Vol 556-562 ◽  
pp. 3598-3601
Author(s):  
Jin Zu Ji
Keyword(s):  
Electromagnetic Wave ◽  
Complex Number ◽  
Coordinate Transformation ◽  
Stokes Parameter ◽  
The Other ◽  
Stokes Parameters ◽  
Algebra Structure ◽  
Wave Polarization ◽  
Matrix Operation ◽  
Matrix Problems

Four two-ordered basis matrices were introduced to deduct Stokes parameter representing electromagnetic wave polarization. Two of them have algebra features similar to unity and imaginary of complex number, so an exponential function was defined which can easily express some matrix operation such as coordination rotation in 2-dimension. The other 2 basis matrices were also incorporated to deduce the Stokes parameters. The four matrices have some fatigue algebra structure which was incorporated in deduction. The coordinate transformation was converted to some matrix problems and we get a more concise result.

Research on 2-D DCT Algorithm and Performance Based on Transform Basic Matrix

2011 ◽  
Vol 58-60 ◽  
pp. 2570-2575
Author(s):  
Wen Bang Sun ◽  
He Xin Chen ◽  
Wen Bing Sun ◽  
Mai Yu Zhou
Keyword(s):  
Information Processing ◽  
Theoretical Analysis ◽  
Total Space ◽  
Processing Technology ◽  
Matrix Operation ◽  
Basic Matrix ◽  
Operation Method ◽  
Space Characteristic ◽  
And Performance

With the development of information processing technology, 2-D DCT has been used more and more widely. But the 2-D DCT is accomplished by computing twice 1-D DCT successively, and cannot embody the total space characteristic of 2-D transform well. To overcome such drawbacks, the paper has broken the traditional thinking of DCT operation, and proposed 2-D SDCT operation method. First, some new 2-D matrix operation principles are defined. Then, the transform basic matrix used for 2-D SDCT operation was build and the operation principle of 2-D SDCT is described in detail. Finally, the performance of 2-D SDCT was described systematically. The theoretical analysis shows that the proposed method makes 2-D DCT succinct to express, easy to comprehend and convenient to operate.

Sign in / Sign up

Export Citation Format

Share Document