|
|
|
|
|
Argyrios Sideris, Theodora Sanida and Minas Dasygenis
Hash functions are an essential mechanism in today?s world of information security. It is common practice to utilize them for storing and verifying passwords, developing pseudo-random sequences, and deriving keys for various applications, including milit...
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
|
|
|
|
|
|
|
|
|
|
|
Kunbolat Algazy, Kairat Sakan, Nursulu Kapalova, Saule Nyssanbayeva and Dilmukhanbet Dyusenbayev
The article observes the new hashing algorithm HBC-256. The HBC-256 algorithm is based on the block cipher of the compression function CF (Compression Function) and produces a 256-bits hash value. Like any new cryptographic structure, the HBC-256 algorit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Khumbelo Muthavhine and Mbuyu Sumbwanyambe
Cryptographic algorithms installed on Internet of Things (IoT) devices suffer many attacks. Some of these attacks include the differential linear attack (DL). The DL attack depends on the computation of the probability of differential-linear characterist...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nikita Konstantinovich Chistousov, Igor Anatolyevich Kalmykov, Daniil Vyacheslavovich Dukhovnyj, Maksim Igorevich Kalmykov and Aleksandr Anatolyevich Olenev
Authentication protocols are expanding their application scope in wireless information systems, among which are low-orbit satellite communication systems (LOSCS) for the OneWeb space Internet, automatic object identification systems using RFID, the Inter...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bertrand Cambou, Michael Gowanlock, Bahattin Yildiz, Dina Ghanaimiandoab, Kaitlyn Lee, Stefan Nelson, Christopher Philabaum, Alyssa Stenberg and Jordan Wright
Using physical unclonable functions (PUFs), in support of networks secured with a public key infrastructure, to generate, on demand, the key pairs needed for lattice and code PQC algorithms.
|
|
|
|
|
|
|
|
|
|
|
Sergey Agafyin,Stanislav Smyshlyaev
Pág. 84 - 89
The task of enabling usage of cryptographic software (especially, for working with digital signature) with general-purpose mobile devices (e.g., smartphones with iOS or Android operation systems) is inevitably discussed during all conference discussions ...
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
|
|
|
|
|
|
|
|
|
|
|
Barry Fagin
Previous work established the set of square-free integers n with at least one factorization ??=??¯??¯
n
=
p
¯
q
¯
for which ??¯
p
¯
and ??¯
q
¯
are valid RSA keys, whether they are prime or composite. These integers are exactly those with the property...
ver más
|
|
|
|
|
|
|
|
|
|
|
Inka Trisna Dewi, Amang Sudarsono, Prima Kristalina, Mike Yuliana
Pág. 140 - 160
One effort to secure vehicle-to-vehicle (V2V) communication is to use a symmetrical cryptographic scheme that requires the distribution of shared secret keys. To reduce attacks on key distribution, physical layer-based key formation schemes that utilize ...
ver más
|
|
|
|
|
|