Secured Data Storage Using Deduplication in Cloud Computing Based on Elliptic Curve Cryptography

The tremendous development of cloud computing with related technol-ogies is an unexpected one.However,centralized cloud storage faces few chal-lenges such as latency,storage,and packet drop in the network.Cloud storage gets more attention due to its huge data storage and ensures the security of secret information.Most of the developments in cloud storage have been positive except better cost model and effectiveness,but still data leakage in security are billion-dollar questions to consumers.Traditional data security techniques are usually based on cryptographic methods,but these approaches may not be able to with-stand an attack from the cloud server's interior.So,we suggest a model called multi-layer storage(MLS)based on security using elliptical curve cryptography(ECC).The suggested model focuses on the significance of cloud storage along with data protection and removing duplicates at the initial level.Based on divide and combine methodologies,the data are divided into three parts.Here,thefirst two portions of data are stored in the local system and fog nodes to secure the data using the encoding and decoding technique.The other part of the encrypted data is saved in the cloud.The viability of our model has been tested by research in terms of safety measures and test evaluation,and it is truly a powerful comple-ment to existing methods in cloud storage.

Ground-0 Axioms vs.First Principles and Second Law:From the Geometry of Light and Logic of Photon to Mind-Light-Matter Unity-AI&QI

Without the geometry of light and logic of photon,observer-observability forms a paradox in modern science,truthequilibrium finds no unification,and mind-light-matter unity is unreachable in spacetime.Subsequently,quantum mechanics has been shrouded with mysteries preventing itself from reaching definable causality for a general purpose analytical quantum computing paradigm.Ground-0 Axioms are introduced as an equilibrium-based,dynamic,bipolar set-theoretic unification of the first principles of science and the second law of thermodynamics.Related literatures are critically reviewed to justify the self-evident nature of Ground-0 Axioms.A historical misinterpretation by the founding fathers of quantum mechanics is identified and corrected.That disproves spacetime geometries(including but not limited to Euclidean and Hilbert spaces)as the geometries of light and truth-based logics(including but not limited to bra-ket quantum logic)as the logics of photon.Backed with logically definable causality and Dirac 3-polarizer experiment,bipolar quantum geometry(BQG)and bipolar dynamic logic(BDL)are identified as the geometry of light and the logic of photon,respectively,and wave-particle complementarity is shown less fundamental than bipolar complementarity.As a result,Ground-0 Axioms lead to a geometrical and logical illumination of the quantum and classical worlds as well as the physical and mental worlds.With logical resolutions to the EPR and Schr?dinger’s cat paradoxes,an analytical quantum computing paradigm named quantum intelligence(QI)is introduced.It is shown that QI makes mind-light-matter unity and quantum-digital compatibility logically reachable for quantumneuro-fuzzy AI-machinery with groundbreaking applications.It is contended that Ground-0 Axioms open a new era of science and philosophy—the era of mind-light-matter unity in which humanlevel white-box AI&QI is logically prompted to join Einstein’s grand unification to foster major scientific advances.

Cryptanalysis of Schemes Based on Pseudoinverse Matrix

Advances in quantum computation threaten to break public key eryptosystems that are based on the difficulty of fac- torization or the difficulty of discrete logariths, although , no quantum algorithms have been found to be able to solve certain mathematical problems on non-commutative algebraic structures up to now. The proposed new quasi-inverse based cryptography scheme is vulnerable to a linear algebra attack based on the probable occurrence of weak keys in the generation process. In this paper, we illustrate that two of the quasi-inverse based cryptography are vulnerable to a structural attack and that it only requires polynomial time to obtain the equivalent keys for some given public keys. In addition, we conduct a detailed analysis on attack methods and provide some improved suggestions on these two schemes.