Results 1 to 10 of about 116,559 (398)

Security amplification by composition: The case of doubly-iterated, ideal ciphers [PDF]

open access: bronzearXiv, 1998
We investigate, in the Shannon model, the security of constructions corresponding to double and (two-key) triple DES. That is, we consider F_{k1}(F_{k2}(.)) and F_{k1}(F_{k2}^{-1}(F_{k1}(.))) with the component functions being ideal ciphers. This models the resistance of these constructions to ``generic'' attacks like meet in the middle attacks.
William Aiello   +3 more
arxiv   +5 more sources

A Complex Transformation of Monoalphabetic Cipher to Polyalphabetic Cipher: (Vigenère-Affine Cipher) [PDF]

open access: yesInternational Journal of Machine Learning and Computing, 2019
Fast progression of digital data exchange in electronic way, information security is becoming much more important in data storage and transmission on public communication networks.
Tun Myat Aung, Htet Naing, Ni Ni Hla
semanticscholar   +3 more sources

Perfectly secure cipher system [PDF]

open access: greenarXiv, 2000
We present a perfectly secure cipher system based on the concept of fake bits which has never been used in either classical or quantum cryptography.
Arindam Mitra
arxiv   +3 more sources

Y-00 Quantum-Noise Randomized Stream Cipher Using Intensity Modulation Signals for Physical Layer Security of Optical Communications

open access: yesJournal of Lightwave Technology, 2020
The Internet plays an essential role in modern societies and in the amount of sensitive data transported over the optical networks that shows its' importance has increased drastically.
Fumio Futami   +2 more
exaly   +2 more sources

A family of trapdoor ciphers [PDF]

open access: bronze, 1997
This paper presents several methods to construct trapdoor block ciphers. A trapdoor cipher contains some hidden structure; knowledge of this structure allows an attacker to obtain information on the key or to decrypt certain ciphertexts. Without this trapdoor information the block cipher seems to be secure.
Vincent Rijmen, Bart Preneel
openalex   +4 more sources

GPT-4 Is Too Smart To Be Safe: Stealthy Chat with LLMs via Cipher [PDF]

open access: yesInternational Conference on Learning Representations, 2023
Safety lies at the core of the development of Large Language Models (LLMs). There is ample work on aligning LLMs with human ethics and preferences, including data filtering in pretraining, supervised fine-tuning, reinforcement learning from human ...
Youliang Yuan   +6 more
semanticscholar   +1 more source

The SPEEDY Family of Block Ciphers - Engineering an Ultra Low-Latency Cipher from Gate Level for Secure Processor Architectures

open access: yesIACR Cryptology ePrint Archive, 2021
We introduce SPEEDY, a family of ultra low-latency block ciphers. We mix engineering expertise into each step of the cipher’s design process in order to create a secure encryption primitive with an extremely low latency in CMOS hardware.
G. Leander   +3 more
semanticscholar   +1 more source

Unraveling synonymous and deep intronic variants causing aberrant splicing in two genetically undiagnosed epilepsy families

open access: yesBMC Medical Genomics, 2021
Background Variants identified through parent–child trio-WES yield up to 28–55% positive diagnostic rate across a variety of Mendelian disorders, there remain numerous patients who do not receive a genetic diagnosis.
Qiang Li   +5 more
doaj   +1 more source

Exon skipping caused by a complex structural variation in SH2D1A resulted in X‐linked lymphoproliferative syndrome type 1

open access: yesMolecular Genetics & Genomic Medicine, 2022
Background X‐linked lymphoproliferative syndrome type 1 (XLP1) is a rare primary immunodeficiency disorder characterized by severe immune dysregulation often after viral infection. It is caused by hemizygous mutations in the X‐linked SH2D1A gene.
Liwen Wu   +5 more
doaj   +1 more source

Reflection ciphers [PDF]

open access: yesDesigns, Codes and Cryptography, 2015
This paper investigates ciphers where the set of encryption functions is identical to the set of decryption functions, which we call reflection ciphers. Equivalently, there exists a permutation P, named the coupling permutation, such that decryption under k corresponds to encryption under P(k).
Boura, Christina   +3 more
openaire   +6 more sources

Home - About - Disclaimer - Privacy