|
|
|
|
|
Maki Kihara and Satoshi Iriyama
A new class of cryptosystems called verifiable encryption (VE) that facilitates the verification of two plaintexts without decryption was proposed in our previous paper. The main contributions of our previous study include the following. (1) Certain cryp...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anish Saini, Athanasios Tsokanos and Raimund Kirner
Cryptography is the study and practice of secure communication with digital data and focuses on confidentiality, integrity, and authentication. Random number generators (RNGs) generate random numbers to enhance security. Even though the cryptographic alg...
ver más
|
|
|
|
|
|
|
|
|
|
|
Behrouz Zolfaghari and Takeshi Koshiba
In recent years, neural networks and cryptographic schemes have come together in war and peace; a cross-impact that forms a dichotomy deserving a comprehensive review study. Neural networks can be used against cryptosystems; they can play roles in crypta...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tyler Cultice and Himanshu Thapliyal
The Controller Area Network (CAN) is a bus protocol widely used in Electronic control Units (ECUs) to communicate between various subsystems in vehicles. Insecure CAN networks can allow attackers to control information between vital vehicular subsystems....
ver más
|
|
|
|
|
|
|
|
|
|
|
Rameez Asif
The latest quantum computers have the ability to solve incredibly complex classical cryptography equations particularly to decode the secret encrypted keys and making the network vulnerable to hacking. They can solve complex mathematical problems almost ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bo Yang, Ruwei Huang and Jianan Zhao
Key-dependent message (KDM) security is of great research significance, to better analyse and solve the potential security problems in complex application scenarios. Most of the current KDM security schemes are based on traditional hard mathematical prob...
ver más
|
|
|
|
|
|
|
|
|
|
|
Donghoe Heo, Suhri Kim, Young-Ho Park and Seokhie Hong
In this paper, we present the performance and security analysis for various commutative SIDH (CSIDH)-based algorithms. As CSIDH offers a smaller key size than SIDH and provides a relatively efficient signature scheme, numerous CSIDH-based key exchange al...
ver más
|
|
|
|
|
|
|
|
|
|
|
Eduard Primenko,Andrey Rybkin
Pág. 11 - 22
In this paper, we survey a cryptographic direction of post-quantum cryptography based on logarithmic signatures and covers of finite groups. These mathematical structures allows designing cryptosystems with security based on hardness of the factori...
ver más
|
|
|
|
|
|
|
|
|
|
|
ByeongGyu Park, Suhri Kim, Seokhie Hong, HeeSeok Kim and Seog Chung Seo
Beginning with the proposal of the McEliece cryptosystem in 1978, code-based cryptography has positioned itself as one of main categories in post-quantum cryptography (PQC). To date, the algebraic security of certain variants of McEliece cryptosystems ha...
ver más
|
|
|
|
|
|
|
|
|
|
|
Marco Baldi, Alessandro Barenghi, Franco Chiaraluce, Gerardo Pelosi and Paolo Santini
Decoding of random linear block codes has been long exploited as a computationally hard problem on which it is possible to build secure asymmetric cryptosystems. In particular, both correcting an error-affected codeword, and deriving the error vector cor...
ver más
|
|
|
|
|
|