Results 101 to 110 of about 6,164,294 (286)
On the discrete logarithm problem in class groups of curves [PDF]
Mathematics of Computation, 2010 We study the discrete logarithm problem in degree 0 class groups of curves over finite fields, with particular emphasis on curves of small genus. We prove that for every fixed g
openaire +3 more sources
Closing the Empirical Loop: Autonomous AI Agents Conduct End‐to‐end Research With Human Participants
Advanced Science, EarlyView.A multi‐agent AI system autonomously executes the complete scientific workflow, from hypothesis to manuscript, across three psychological studies involving 288 participants. The system designs experiments, collects real world data, develops analysis pipelines, and writes manuscripts with theoretical rigor comparable to experienced researchers.
Gabrielle Wehr +6 more
wiley +1 more source
The Discrete Logarithm Problem in GL(n, q)
, 2008 This paper presents a probabilistic polynomial-time reduction of the discrete logarithm problem in the general linear group GL(n; q) to the discrete logarithm problem in some small extension fields of ...
Alfred J. Menezes, et al.
core
NbOx Mott Memristor‐Based Oscillatory P‐trit for Ternary Potts Machine
Advanced Science, EarlyView.A ternary Potts machine utilizing NbOx‐based probabilistic trits (p‐trits) is demonstrated for efficient combinatorial optimization. By leveraging the electro‐thermal switching dynamics of NbOx memristors, this architecture generates three‐state stochastic fluctuations.
Hakseung Rhee +10 more
wiley +1 more source
Stochastic Entanglement of Deterministic Origami Tentacles For Robust Robotic Grasping
Advanced Science, EarlyView.This study introduces an origami tentacle gripper to robustly grasp objects‐in air, underwater, and even in orbital space‐by exploiting a synergy between local, deterministic deformation programming and global, stochastic entanglements. A single origami tentacle can be designed to coil with a simple tendon pull.
Alec Boron +4 more
wiley +1 more source
Bistable Networks Enable Complex Shape Changes
Advanced Science, EarlyView.Transition‐controlled metamaterials are networks of bistable mechanical memory that store local binary states and express them as global shape change. By decoupling low‐force programming from high‐force holding, a single lattice is reconfigured into distinct 2D profiles and 3D surfaces without continuous actuation, enabling reusable morphing materials ...
Sawyer Thomas, Jeffrey Lipton
wiley +1 more source
Advanced Science, EarlyView.A latent diffusion‐based framework is proposed for designing functionally graded metamaterials with perfect connectivity. By integrating vector‐quantized latent representations with mechanistic guidance, the framework enables accurate inverse design toward target elastic properties.
Jongbin Yu, Dosung Lee, Namjung Kim
wiley +1 more source
Lower Bounds for Discrete Logarithms and Related Problems [PDF]
, 1997 This paper considers the computational complexity of the discrete logarithm and related problems in the context of "generic algorithms"--that is, algorithms which do not exploit any special properties of the encodings of group elements, other than the property that each group element is encoded as a unique binary string.
openaire +1 more source
CoSP: Reconfigurable Metamaterial Inverse Design via Contrastive Pretrained Large Language Model
Advanced Science, EarlyView.In this work, CoSP (contrastive multi‐state pretrain), an intelligent inverse design method for reconfigurable metamaterials based on a contrastive pretrained large language model, is proposed. Numerical experiments demonstrate that CoSP can design reconfigurable metamaterial structures for multi‐state, multi‐band optical responses, showing great ...
Shujie Yang +4 more
wiley +1 more source
On new multivariate cryptosystems based on hidden Eulerian equations
Доповiдi Нацiональної академiї наук УкраїниWe propose new multivariate cryptosystems over an n-dimensional free module over the arithmetical ring Zm based on the idea of hidden discrete logarithm for Zm∗. These cryptosystems are based on the hidden Eulerian equations.
V.A. Ustimenko
doaj +1 more source