While vehicular ad hoc Networks (VANETs) are relatively well-studied, a number of challenges remain, particularly as autonomous vehicles become more commonplace. For example, devices on a vehicle such as, On-Board Uni...
详细信息
While vehicular ad hoc Networks (VANETs) are relatively well-studied, a number of challenges remain, particularly as autonomous vehicles become more commonplace. For example, devices on a vehicle such as, On-Board Units (OBUs) may have resource constraints which render them incapable of supporting computationally expensive cryptography operations required to achieve various security features. One potential solution is to offload computationally expensive tasks to other nodes in the VANET;however, the dynamic nature of the setup (such as the, mobility of the requesting vehicles and other nodes) compounds the challenge of resource management. In this context, we propose a scheme that uses Ciphertext-Policy Attribute-Based Encryption (CP-ABE) to achieve data confidentiality in VANETs despite such challenges. Specifically, we build a cluster of vehicles to perform CP-ABE operations without relying on other nodes in the VANET. We use Kubernetes, an open-source container orchestration system, to build vehicle cluster(s) to handle distributed micro-tasks. In this scheme, we use a set of factors that impact the computation operations in cluster vehicle components (i.e., the OBU). Each factor, including the distance between the data owner vehicle and the target vehicle, the duration of each target vehicle in the cluster, and the resource of each vehicle in the cluster, has a weight based on its influence in computational operations. The euclidean method is used to calculate the weight value for each factor. Based on the final total weight for each vehicle, our approach distributes the tasks between vehicles. We evaluate our results by comparing our approach with the mechanism of Kubernetes for task distribution, which only considers the resources in each vehicle. We also consider several scenarios with varying factors to evaluate their impact on the execution time of CP-ABE on OBUs in addition to using simulations to evaluate the performance of our approach in terms of trans
We introduce a multi-dimensional generalization of the euclidean algorithm and show how it is related to digital geometry and particularly to the generation and recognition of digital planes. We show how to associate ...
详细信息
We introduce a multi-dimensional generalization of the euclidean algorithm and show how it is related to digital geometry and particularly to the generation and recognition of digital planes. We show how to associate with the steps of the algorithm geometrical extensions of substitutions, i.e., rules that replace faces by unions of faces, to build finite sets called patterns. We examine several of their combinatorial, geometrical and topological properties. This work is a first step toward the incremental computation of patterns that locally fit a digital surface for the accurate approximation of tangent planes.
We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal basis for this module using the Eucli...
详细信息
ISBN:
(纸本)9784885522925
We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal basis for this module using the euclidean algorithm with respect to composition of polynomials. For a given received word, our decoding algorithm computes a list of all codewords that are closest to the received word with respect to the rank metric.
For a given quadratic irrational a, let us denote by D(a) the length of the periodic part of the continued fraction expansion of a. We prove that for every positive integer d, which is not a perfect square, there are ...
详细信息
For a given quadratic irrational a, let us denote by D(a) the length of the periodic part of the continued fraction expansion of a. We prove that for every positive integer d, which is not a perfect square, there are infinitely many even integers k = 1, for which v the equality D(nvd) = k holds for infinitely many integers n = 1.
We consider three families of groups: the Bianchi groups SL(2, O) where O is the ring of integers of an imaginary, quadratic field;the groups SL double dagger(2, O) where O is a double dagger-order of a definite, rati...
详细信息
We consider three families of groups: the Bianchi groups SL(2, O) where O is the ring of integers of an imaginary, quadratic field;the groups SL double dagger(2, O) where O is a double dagger-order of a definite, rational quaternion algebra with an orthogonal involution;and the groups SL(2, O) where O is an order of a definite, rational quaternion algebra. We show that such groups are generated by elementary matrices if and only if O is semi-euclidean (or double dagger-semi-euclidean), which is a generalization of the usual notion of a euclidean ring. The proofs are surprisingly simple and proceed by considering fundamental domains of Kleinian groups.
The RSA encryption system,a cornerstone of numerous cryptographic frameworks,has long enjoyed a reputation for ***,its strength is inherently tethered to the meticulous selection and management of its foundational pri...
详细信息
The RSA encryption system,a cornerstone of numerous cryptographic frameworks,has long enjoyed a reputation for ***,its strength is inherently tethered to the meticulous selection and management of its foundational prime numbers,p and *** study delves into a nuanced vulnerability that surfaces when p and q assume particularly large *** this context,we illuminate how the euclidean method can be weaponized to swiftly decipher RSA-encrypted messages,unveiling the original plaintext with surprising ***,our analysis also uncovers that harnessing parallel computation for the euclidean method expedites decryption exponentially,accentuating this *** revelations cast a spotlight on a delicate balancing act between computational prowess and cryptographic *** insights gleaned from our research emphasize the paramount importance of judicious prime selection in the RSA *** also caution about the unforeseen pitfalls that might lurk behind algorithmic enhancements in cryptographic *** this investigation,we aspire to catalyse a critical re-evaluation of RSA's real-world deployments and champion a more circumspect,continually adaptive approach to designing cryptographic systems.
The rigidity degree of a generator-cogenerator determines the dominant dimension of its endomorphism algebra, and is closely related to a recently introduced homological dimension - rigidity dimension. In this paper, ...
详细信息
The rigidity degree of a generator-cogenerator determines the dominant dimension of its endomorphism algebra, and is closely related to a recently introduced homological dimension - rigidity dimension. In this paper, we give explicit formulae for the rigidity degrees of all indecomposable modules over representation-finite self-injective algebras by developing combinatorial methods from the euclidean algorithm. As an application, the rigidity dimensions of some algebras of types A and E are given.& COPY;2023 Elsevier B.V. All rights reserved.
We address the following natural but hitherto unstudied question: what are the possible linear extension numbers of an n-element poset? Let LE( n) denote the set of all positive integers that arise as the number of li...
详细信息
We address the following natural but hitherto unstudied question: what are the possible linear extension numbers of an n-element poset? Let LE( n) denote the set of all positive integers that arise as the number of linear extensions of some n-element poset. We show that LE( n) skews towards the "small" end of the interval [1, n!]. More specifically, LE( n) contains all of the positive integers up to exp c n log n for some absolute constant c, and |LE( n) n ((n - 1)!, n!]| < (n - 3)!. The proof of the former statement involves some intermediate number-theoretic results about the Stern-Brocot tree that are of independent interest.
In today's world driver drowsiness is a major reason for fatal accidents of on road vehicles. Developing an automated, real-time drowsiness detection system is essential to provide accurate and timely alerts to th...
详细信息
In today's world driver drowsiness is a major reason for fatal accidents of on road vehicles. Developing an automated, real-time drowsiness detection system is essential to provide accurate and timely alerts to the driver. In the proposed system, hybrid approach of CNN (Convolutional Neural Network) and BiLSTM (Bidirectional Long Term Dependencies) is used to detect the driver's drowsiness. Video camera is used to track the facial image and eye blinks of the driver. The proposed system works in three main phases: In the First phase, driver's face image is Identified and observed using a web camera. In the Second phase, the eye image features are extracted using the euclidean algorithm. During the third phase, the eye blinks are continually monitored. The final stage decides whether the measure in eye square is closed state or open state. When a driver falls asleep, there will be a warning message to alert the driver to prevent road accidents. (c) 2021 Elsevier Ltd. All rights reserved. Selection and peer-review under responsibility of the scientific committee of the International Conference on Advances in Materials Research-2019.
Let K be a number field with unit rank at least four, containing a subfield M such that K/M is Galois of degree at least four. We show that the ring of integers of K is a euclidean domain if and only if it is a princi...
详细信息
Let K be a number field with unit rank at least four, containing a subfield M such that K/M is Galois of degree at least four. We show that the ring of integers of K is a euclidean domain if and only if it is a principal ideal domain. This was previously known under the assumption of the generalized Riemann Hypothesis for Dedekind zeta functions. We prove this unconditionally.
暂无评论