Results 51 to 60 of about 7,628 (169)
AN ARCHITECTURAL MODEL FOR CONTENT MANAGEMENT IN E-COMMERCE APPLICATIONS USING INTELLIGENT AGENTS
Havacılık ve Uzay Teknolojileri Dergisi, 2011 In e-Commerce applications, the size of the architecture is huge and there are too many member shops and too many customers that bring along management difficulties.
Akhan Akbulut, Güray Yılmaz
doaj
An Analysis of Bitstate Hashing [PDF]
Formal Methods in System Design, 1996 The bitstate hashing, or supertrace, technique was introduced in 1987 as a method to increase the quality of verification by reachability analyses for applications that defeat analysis by traditional means because of their size. Since then, the technique has been included in many research verification tools, and was even adopted in some tools that are ...
openaire +1 more source
Advances in Electrical and Electronic Engineering, 2003 For identification of any message it is not necessary to have available all message, but it is sufficient for its autentication its hashing. Hashing is used at safe put passwords, decode keys, autentication its hashing.
Ladislav Schwartz, Dusan Trstensky
doaj
Dual-branch autoencoder network for attacking deep hashing image retrieval models
Dianxin kexue, 2023 Due to its powerful representation learning capabilities and efficient computing capabilities, deep learning-based hashing (deep hashing) methods are widely used in large-scale image retrieval.However, there are less studies on the security of deep ...
Sizheng FU +4 more
doaj
Information and Control, 1984 Summary: A concept of complexity of hashing is introduced and studied with special attention to the lower bounds of complexity. A new class of rather simple hash-functions is developed. These functions are shown to be near optimal within this concept of complexity.
openaire +2 more sources
SHA-1 and MD5 Cryptographic Hash Functions: Security Overview
Communications, 2015 Despite their obsolescence and recommendations they are phased out from production environment, MD5 and SHA-1 cryptographic hash functions remain defaults frequently offered in many applications, e.g., database managers.
Roman Jasek
doaj +1 more source
Hashing to detect identical ordering of species in a shared sublattice
Science and Technology of Advanced Materials: MethodsFinding very low energy configurations of species on a shared sublattice is unavoidable in some problems governed by ground states of the sublattice, such as voltage curve estimation of battery cathode materials. Calculations of partial occupancy systems,
Yoyo Hinuma
doaj +1 more source
Hashing into Hessian curves [PDF]
International Journal of Applied Cryptography, 2011 We describe a hashing function from the elements of the finite field Fq into points on a Hessian curve. Our function features the uniform and smaller size for the cardinalities of almost all fibers compared with the other known hashing functions for elliptic curves. For ordinary Hessian curves, this function is 2 : 1 for almost all points.
openaire +2 more sources
Heisenberg Group-Based Digital Signatures for Secure Communications
IEEE AccessThis paper proposes a new digital signature algorithm that employs the Heisenberg group over a prime field and exploits its structure to provide strong cryptographic properties. The developed scheme involves the Heisenberg group within a commutator-based
Najla Althuniyan +4 more
doaj +1 more source
Random Structures & Algorithms, 2000 AbstractWe define a family of functions F from a domain U to a range R to be dispersing if for every set S ⊆ U of a certain size and random h ∈ F, the expected value of ∣S∣ – ∣h[S]∣ is not much larger than the expectation if h had been chosen at random from the set of all functions from U to R.We give near‐optimal upper and lower bounds on the size of ...
openaire +2 more sources