"AFacet": a geometry based format and visualizer to support SAR and multisensor signature generation

This work presents a methodology to monitor the power signature of IoT devices for detecting operation abnormality. It does not require bulky measurement equipment thanks to the proposed power signature generation circuit which can be integrated into LDO voltage regulators. The proposed circuit is implemented using a 130 nm CMOS technology and simulated with power trace measured from a wireless sensor. It shows the generated power signature accurately reflects the power consumption and can be used to distinguish different operation conditions, such as wireless transmission levels, data sampling rates and microcontroller UART communications.

Download Full-text

Digital signature scheme on the 2 x 2 matrix algebra

Vestnik of Saint Petersburg University Applied Mathematics Computer Science Control Processes ◽

10.21638/11701/spbu10.2021.303 ◽

2021 ◽

Vol 17 (3) ◽

pp. 254-261

Author(s):

Nikolay A. Moldovyan ◽

◽

Alexandr A. Moldovyan ◽

Keyword(s):

Digital Signature ◽

High Performance ◽

Matrix Algebra ◽

Multiplicative Group ◽

Discrete Logarithm ◽

Signature Scheme ◽

The Public ◽

Signature Generation ◽

Commutative Subalgebras ◽

Digital Signature Scheme

The article considers the structure of the 2x2 matrix algebra set over a ground finite field GF(p). It is shown that this algebra contains three types of commutative subalgebras of order p2, which differ in the value of the order of their multiplicative group. Formulas describing the number of subalgebras of every type are derived. A new post-quantum digital signature scheme is introduced based on a novel form of the hidden discrete logarithm problem. The scheme is characterized in using scalar multiplication as an additional operation masking the hidden cyclic group in which the basic exponentiation operation is performed when generating the public key. The advantage of the developed signature scheme is the comparatively high performance of the signature generation and verification algorithms as well as the possibility to implement a blind signature protocol on its base.

Download Full-text

Comparing the speed of the selected hash and encryption algorithms

Journal of Computer Sciences Institute ◽

10.35784/jcsi.598 ◽

2017 ◽

Vol 4 ◽

pp. 82-86

Author(s):

Dawid Górniak ◽

Piotr Kopniak

Keyword(s):

Programming Language ◽

Research Group ◽

Data Security ◽

Hash Function ◽

Hash Functions ◽

Encryption Algorithm ◽

Java Programming ◽

Signature Generation ◽

Encryption Algorithms ◽

Valuable Thing

The data is often the most valuable thing that we collect on our computers. Without proper data security with encryption our valuable information may be illegally used by an unauthorised person. The article presents selected encryption methods and hash functions available in Boucy Castle library for Java programming language. The presented analysis applies to measurement of the speed of signature generation and verification. The signatures are for 240 bit encryption algorithms. In case of a hash function, the analysis refers to the speed of such functions. The fastest encryption algorithm and hash function from the research group were AES and SHA1.

Download Full-text