Search results for "Cryptosystem"

showing 6 items of 6 documents

Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra

2019

AbstractWe propose three cryptographic key exchange protocols in the octonion algebra. Using the totient function, defined for integral octonions, we generalize the RSA public-key cryptosystem to the octonion arithmetics. The two proposed symmetric cryptographic key exchange protocols are based on the automorphism and the derivation of the octonion algebra.

Algebra and Number TheoryApplied Mathematics020206 networking & telecommunicationsEuler's totient function0102 computer and information sciences02 engineering and technologyAutomorphism01 natural sciencesOctonionOctavian totient functionQuaternion cryptographyAlgebraOctonion cryptographysymbols.namesakeOctonion RSA algorithm010201 computation theory & mathematicsTheory of computation0202 electrical engineering electronic engineering information engineeringsymbolsCryptosystemNon-associative cryptographyOctonion algebraMathematicsApplicable Algebra in Engineering, Communication and Computing
researchProduct

Cryptanalysis of Knapsack Cipher Using Ant Colony Optimization

2018

Ant Colony Optimization is a search metaheuristic inspired by the behavior of real ant colonies and shown their effectiveness, robustness to solve a wide variety of complex problems. In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of knapsack cipher algorithm. A Cipher-text only attack is used to discover the plaintext from the cipher-text. Moreover, our approach allows us to break knapsack cryptosystem in a minimum search space when compared with other techniques. Experimental results prove that ACO can be used as an effective tool to attack knapsack cipher.

Computer scienceAnt colony optimization algorithmsMathematicsofComputing_NUMERICALANALYSISMerkle–Hellman knapsack cryptosystemPlaintextData_CODINGANDINFORMATIONTHEORYAnt colonyComputingMethodologies_ARTIFICIALINTELLIGENCElaw.inventionKnapsack problemlawTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYCryptosystemCryptanalysisAlgorithmMetaheuristicSSRN Electronic Journal
researchProduct

New key based on tilted lenses for optical encryption

2016

A novel concept based on tilted spherical lenses for optical encryption using Lohmann’s type I systems is presented. The tilt angle of the spherical lenses is used as an encrypted key and the decryption performance is studied both qualitatively (visual image degradation) and quantitatively (mean squared error analysis) by numerical simulations. The paper presents a general mathematical framework in virtue of the dioptric power matrix formalism and oblique central refraction used in the optometry field. Computer simulations show that image information cannot be retrieved after a few degrees of tilt on both spherical lenses in the encryption system. In addition, a preliminary experiment is pr…

Computer sciencebusiness.industryMaterials Science (miscellaneous)ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONEncryption01 natural sciencesGeneralLiterature_MISCELLANEOUSIndustrial and Manufacturing EngineeringOptical encryption010309 optics03 medical and health sciences0302 clinical medicineOpticsComputer Science::Multimedia0103 physical sciences030221 ophthalmology & optometryHybrid cryptosystemBusiness and International ManagementbusinessComputingMethodologies_COMPUTERGRAPHICSComputer Science::Cryptography and SecurityApplied Optics
researchProduct

Security of public key cryptosystems based on Chebyshev Polynomials

2004

Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and digital signature. The cryptosystem works on real numbers and is quite efficient. Unfortunately, from our analysis it comes up that it is not secure. We describe an attack which permits to recover the corresponding plaintext from a given ciphertext. The same attack can be applied to produce forgeries …

FOS: Computer and information sciencesPlaintext-aware encryptionTheoretical computer scienceComputer Science - Cryptography and SecurityCramer–Shoup cryptosystemData_CODINGANDINFORMATIONTHEORYDeterministic encryptionHybrid cryptosystemCryptosystemElectrical and Electronic EngineeringSemantic securityThreshold cryptosystemCryptography and Security (cs.CR)Goldwasser–Micali cryptosystemMathematics
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

New adaptive synchronization algorithm for a general class of complex hyperchaotic systems with unknown parameters and its application to secure comm…

2022

Abstract The aim of this report is to investigate an adaptive synchronization (AS) for the general class of complex hyperchaotic models with unknown parameters and a new algorithm to achieve this type of synchronization is proposed. Owing to the intricacy behavior of hyperchaotic models that could be effective in secure communications, the special control based on adaptive laws of parameters is constructed analytically, and the corresponding simulated results are performed to validate the algorithm’s accuracy. The complex Rabinovich model is utilized as an enticing example to examine the proposed synchronization technique. A strategy for secure communication improving the overall cryptosyst…

Statistics and Probabilitybusiness.industryComputer scienceTransmitterStability (learning theory)Statistical and Nonlinear Physicssymbols.namesakeAdditive white Gaussian noiseSecure communicationRobustness (computer science)Gaussian noiseSynchronization (computer science)symbolsCryptosystembusinessAlgorithmPhysica A: Statistical Mechanics and its Applications
researchProduct