Search results for "Ciphertext"

showing 3 items of 3 documents

Kasiski's Test: Couldn't the Repetitions be by Accident?

2006

Abstract In searching for repetitions in a periodic polyalphabetic ciphertext, we usually find several true (causal) repetitions that give information about the period. But we also find some accidental repetitions at distances unrelated to the period which may mislead the cryptanalyst. A simple formula shows that these accidents are rather unlikely.

Accident (fallacy)Repetition (rhetorical device)Applied MathematicsAccidentalCiphertextStatisticsArithmeticBirthday problemComputer Science ApplicationsMathematicsTest (assessment)Cryptologia
researchProduct

An Efficient and Secure Multidimensional Data Aggregation for Fog-Computing-Based Smart Grid

2021

International audience; The secure multidimensional data aggregation (MDA) has been widely investigated in smart grid for smart cities. However, previous proposals use heavy computation operations either to encrypt or to decrypt the multidimensional data. Moreover, previous fault-tolerant mechanisms lead to an important computation cost, and also a high communication cost when considering a separate identification phase. In this article, we propose an efficient and secure MDA scheme, named ESMA. Unlike existing schemes, the multidimensional data in ESMA are structured and encrypted into a single Paillier ciphertext and thereafter, the data are efficiently decrypted. For privacy preserving, …

Information privacysmart citiesComputer Networks and CommunicationsComputer scienceDistributed computingCryptography02 engineering and technologyEncryptionPaillier cryptosystem[SPI]Engineering Sciences [physics]Ciphertext0202 electrical engineering electronic engineering information engineeringAuthenticationbusiness.industry020208 electrical & electronic engineering020206 networking & telecommunicationssecurity and privacyComputer Science ApplicationsData aggregationsmart grid (SG)Smart gridHardware and ArchitectureSignal ProcessingScalabilityfog computingbusinessInformation Systems
researchProduct

On the Cryptanalysis of Two Cryptographic Algorithms That Utilize Chaotic Neural Networks

2015

This paper deals with the security and efficiency issues of two cipher algorithms which utilize the principles of Chaotic Neural Networks (CNNs). The two algorithms that we consider are (1) the CNN-Hash, which is a one-way hash function based on the Piece-Wise Linear Chaotic Map (PWLCM) and the One-Way Coupled Map Lattice (OCML), and (2) the Delayed CNN-Based Encryption (DCBE), which is an encryption algorithm based on the delayed CNN. Although both of these cipher algorithms have their own salient characteristics, our analysis shows that, unfortunately, the CNN-Hash is not secure because it is neither Second-Preimage resistant nor collision resistant. Indeed, one can find a collision with …

Theoretical computer scienceArticle SubjectComputer sciencebusiness.industryGeneral Mathematicslcsh:MathematicsHash functionGeneral EngineeringPlaintextCryptographyEncryptionlcsh:QA1-939law.inventionCipherMalleabilitySymmetric-key algorithmlawlcsh:TA1-2040Known-plaintext attackCiphertextCryptanalysisbusinesslcsh:Engineering (General). Civil engineering (General)AlgorithmMathematical Problems in Engineering
researchProduct