Results 41 to 50 of about 12,362 (163)
Vector Field‐Based Collision‐Free Navigation in Tunnel‐Like Environments
Journal of Field Robotics, EarlyView.ABSTRACT Tunnel‐like environments, renowned for their vast scale, confined spaces, and limited visibility, present significant challenges for autonomous robot navigation. This study addresses the critical issue of guiding robots through such environments while ensuring collision‐free navigation and maintaining a specified safety margin from both tunnel
Bao Jianjun +5 more
wiley +1 more source
Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms [PDF]
, 2017 We prove collision bounds for the Pollard rho algorithm to solve the discrete logarithm problem in a general cyclic group $\mathbf {G}$ . Unlike the setting studied by Kim et al., we consider additive walks: the setting used in practice to solve the ...
Bos, Joppe W. +2 more
core
Forgery attacks on several certificateless signature schemes
网络与信息安全学报, 2020 Since Al-Riyami and Paterson proposed the novel concept of certificateless cryptography and the first certificateless signature scheme in 2003, a lot of certificateless signature schemes were proposed one after another. Recently, Tang et al proposed nine
WANG Jing, LI Zumeng
doaj +3 more sources
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT As non‐terrestrial networks (NTNs) become integral to future 6G systems, ensuring seamless connectivity and service continuity over low Earth orbit (LEO) satellite constellations is essential. This work investigates the impact of open radio access network (RAN) functional splits on handover performance in NTNs, focusing on minimizing service ...
Siva Satya Sri Ganesh Seeram +3 more
wiley +1 more source
On the mathematical complexity and the time implementation of proposed variants of elliptic curves cryptosystems [PDF]
, 2013 The group of the elliptic curve points forms an abelian group, which is considered as a suitable choice for constructing a problem similar to the Discrete Logarithm Problem.
Al-Saffar, Najlae F. Hameed +1 more
core
ED25519: A New Secure Compatible Elliptic Curve for Mobile Wireless Network Security
Jordanian Journal of Computers and Information Technology, 2022 Wireless Sensor Networks (WSNs) create various security threats such as application variance in different sectors along with the model of cryptographic primitive and necessity.
MAUSAM DAS, Zenghui Wang
doaj +1 more source
Inference on the Attractor Space via Functional Approximation
Oxford Bulletin of Economics and Statistics, EarlyView.ABSTRACT This paper discusses semiparametric inference on hypotheses on the cointegration and the attractor spaces for I(1)$$ I(1) $$ linear processes with moderately large cross‐sectional dimension. The approach is based on sample canonical correlations and functional approximation of Brownian motions, and it can be applied both to the whole system ...
Massimo Franchi, Paolo Paruolo
wiley +1 more source
An efficient method to generate elliptic curves
Tongxin xuebao, 2001 In this paper, an efficient method to generate elliptic curves for public key cryptosystems based on discrete logarithm problem is presented. Usually, to resist possible attacks, such as MOV reduction, public key cryptosystems based on elliptic curve E ...
ZHOU Chang-ying1 +2 more
doaj +2 more sources
Serial Spatial Transcriptomes Reveal Regulatory Transitions in Maize Leaf Development
Plant Biotechnology Journal, EarlyView.ABSTRACT Plant leaves originate from the shoot apical meristem (SAM) and undergo a developmental process of highly coordinated gene expression regulation. To date, only a few key regulators have been identified and characterised, so the gene expression cascades responsible for leaf cell specification and differentiation from SAM remain largely elusive.
Chi‐Chih Wu +11 more
wiley +1 more source
A Cryptographic Attack: Finding the Discrete Logarithm on Elliptic Curves of Trace One [PDF]
, 2015 The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric problem. The elliptic curve discrete logarithm problem, as it is called, is hoped to be generally hard in one direction but not the other, and it is this ...
Christopher Towse Reader +3 more
core +2 more sources