Blockchain-Based Piecewise Regressive Kupyna Cryptography for Secure Cloud Services
Cloud computing (CC) is a network-based concept where users access data at a specific time and place. The CC comprises servers, storage, databases, networking, software, analytics, and intelligence. Cloud security is the cybersecurity authority dedicated
Selvakumar Shanmugam+5 more
doaj +1 more source
How to Formalize Loop Iterations in Cryptographic Protocols Using ProVerif
The formal verification of cryptographic protocols has been extensively studied in recent years. To verify the cryptographic protocol security, formal verification tools consider protocol properties as interactive processes involving a cryptographic ...
Takehiko Mieno+3 more
doaj +1 more source
A Novel Approach to Increase Security in AODV Using RSA Asymmetric Cryptography and Hash Function [PDF]
Utkarsh Mendevell
openalex +1 more source
Inverting Cryptographic Hash Functions via Cube-and-Conquer
Oleg Zaikin
openalex +2 more sources
Performance Analysis of Cryptographic Hash Functions Suitable for Use in Blockchain [PDF]
Alexandr Kuznetsov+5 more
openalex +1 more source
Study About the Performance of Ascon in Arduino Devices
In 2023, the Ascon cipher suite was selected as the winner of the National Institute of Standards and Technology (NIST) standardization process for lightweight cryptography, and has emerged as the leading candidate for cryptographic algorithms in ...
Ventura Sarasa Laborda+4 more
doaj +1 more source
Exploring Cryptographic Primitives and Secure Hash Functions: A Comprehensive Overview [PDF]
Riddhiman Bhattacharya
openalex +1 more source
Implementation of a Data-Parallel Approach on a Lightweight Hash Function for IoT Devices
The Internet of Things is used in many application areas in our daily lives. Ensuring the security of valuable data transmitted over the Internet is a crucial challenge.
Abdullah Sevin
doaj +1 more source
Building Provably Secure Block Ciphers from Cryptographic Hash Functions
F. Charles
openalex +1 more source
Skyscraper: Fast Hashing on Big Primes
Arithmetic hash functions defined over prime fields have been actively developed and used in verifiable computation (VC) protocols. Among those, ellipticcurve- based SNARKs require large (256-bit and higher) primes. Such hash functions are notably slow,
Clémence Bouvier+6 more
doaj +1 more source