Results 31 to 40 of about 1,726,359 (308)

A customized 152 bit key DES algorithm [PDF]

The International Conference on Electrical Engineering, 2010
In this paper, we proposed a novel technique for modification of the Data Encryption Standard (DES) to ensure a security enhancement against cryptographic attacks that were the main problem in DES algorithm. The proposed modification extended the key size from 64 bit to 152 bit, these extra bits are added to make the S-boxes be dynamically instead of ...
Salah El Agooz, Essam Amer, Alan Eldin Shehata, Mahmoud Ahmed   +3 more
openaire   +1 more source

Design of Secure Chatting Application with End to End Encryption for Android Platform

Iraqi Journal for Computers and Informatics, 2017
In this paper, a secure chatting application with end to end encryption for smart phones that used the android OS has been proposed. This is achieved by the use of public key cryptography techniques.
Ammar Ali, Ali Sagheer
doaj   +3 more sources

Locally collective hydrogen bonding isolates lead octahedra for white emission improvement

Nature Communications, 2019
Low dimensional lead halide perovskites possess intriguing optical properties that are still under debate. Here Cui et al. use hydrogen bonds containing spacers to synthesize highly luminescent perovskites with fully isolated lead-bromide octahedras and ...
Bin-Bin Cui, Ying Han, Bolong Huang, Yizhou Zhao, Xianxin Wu, Lang Liu, Guangyue Cao, Qin Du, Na Liu, Wei Zou, Mingzi Sun, Lin Wang, Xinfeng Liu, Jianpu Wang, Huanping Zhou, Qi Chen   +15 more
doaj   +1 more source

Key agreement from weak bit agreement [PDF]

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, 2005
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+e/2 these bits are equal. Further assume that conditioned on the event SA =n SB no polynomial time bounded algorithm can predict the bit better than with probability 1-δ/2.
openaire   +1 more source

Practical Related-Key Forgery Attacks on Full-Round TinyJAMBU-192/256

IACR Transactions on Symmetric Cryptology, 2023
TinyJAMBU is one of the finalists in the NIST lightweight cryptography competition. It is considered to be one of the more efficient ciphers in the competition and has undergone extensive analysis in recent years as both the keyed permutation as well as
Orr Dunkelman, Shibam Ghosh, Eran Lambooij   +2 more
doaj   +1 more source

Efficient quantum key distribution secure against no-signalling eavesdroppers [PDF]

, 2006
By carrying out measurements on entangled states, two parties can generate a secret key which is secure not only against an eavesdropper bound by the laws of quantum mechanics, but also against a hypothetical "post-quantum" eavesdroppers limited by the ...
Acín A Gisin N Masanes L, Antonio Acín, Barrett J, Barrett J Hardy L Kent A, Barrett J Kent A Pironio S, Bennett C H, Kent A, Masanes L Winter A, Serge Massar, Stefano Pironio   +9 more
core   +2 more sources

Spatial analysis of global Bitcoin mining

Scientific Reports, 2022
Bitcoin mining is not only the fundamental process to maintain Bitcoin network, but also the key linkage between the virtual cryptocurrency and the physical world.
Wei Sun, Haitao Jin, Fengjun Jin, Lingming Kong, Yihao Peng, Zhengjun Dai   +5 more
doaj   +1 more source

From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes [PDF]

, 2015
One approach towards basing public-key encryption (PKE) schemes on weak and credible assumptions is to build “stronger” or more general schemes generically from “weaker” or more restricted ones. One particular line of work in this context was initiated by Myers and shelat (FOCS ’09) and continued by Hohenberger, Lewko, and Waters (Eurocrypt ’12), who ...
Coretti, Sandro, Maurer, Ueli, TACKMANN, BJORN, VENTURI, DANIELE   +3 more
openaire   +2 more sources

Secret Key Generation from Correlated Sources and Secure Link

, 2017
In this paper, we study the problem of secret key generation from both correlated sources and a secure channel. We obtain the optimal secret key rate in this problem and show that the optimal scheme is to conduct secret key generation and key ...
Cao, Daming, Kang, Wei
core   +1 more source

The number of bit comparisons used by Quicksort: an average-case analysis

, 2012
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and so count the number of bit comparisons.
Fill, James Allen, Svante Janson
core   +6 more sources