Results 81 to 90 of about 583 (221)
A New Distributed Primality Test for Shared RSA Keys using Quadratic Fields
In the generation method for RSA-moduli proposed by Boneh and Franklin in [BF97] the partial signing servers generate random shares p i ; q i and compute as candidate for an RSA-modulus n = pq where p = ( p i ) and q = ( q i ). Then they perform
Ingrid Biehl, Tsuyoshi Takagi
core +1 more source
ABSTRACT Objective Aversive (“dark”) personality traits are traditionally studied as predictors of harmful or manipulative behavior, yet their underlying cognitive‐affective structures remain underexplored. This research investigates whether the Dark Core of personality (D)—the common aversive essence of all dark traits—is associated with primal world ...
Robin Schrödter, Benjamin E. Hilbig
wiley +1 more source
Holographic realization of the prime number quantum potential. [PDF]
Cassettari D, Mussardo G, Trombettoni A.
europepmc +1 more source
The Accuracy Smoothness Dilemma in Prediction: A Novel Multivariate M‐SSA Forecast Approach
ABSTRACT Forecasting presents a complex estimation challenge, as it involves balancing multiple, often conflicting, priorities and objectives. Conventional forecast optimization methods typically emphasize a single metric, such as minimizing the mean squared error (MSE), which may neglect other crucial aspects of predictive performance. To address this
Marc Wildi
wiley +1 more source
Title: Frobenius primality tests Author: Jan Hora Department: Department of algebra Supervisor: prof. RNDr. Aleš Drápal, CSc. Dsc. Supervisor's e-mail address: drapal@karlin.mff.cuni.cz Abstract: In the present work we study Extended Quadratic Frobenius ...
Hora, Jan
core +1 more source
Solovay-Strassen primality test
This thesis studies the Solovay-Strassen test for primality of an integer n, which is based on the Jacobi symbol. After formulating the basic algorithm, we compute the probability that the number n being tested is really a prime number if the Solovay ...
Vyhnalová, Sára
core
Lucas Sequences in Primality Testing
Prime or composite? This classification determines whether or not integers can be used in digital security. One such way to begin testing an integers primality is with the Fermat test, which says that if n is a prime number and a is an integer then an-1 ≡
Karl Heimbuck (10081618)
core +1 more source
Renaissance of the Trinitarian: Erwin Schadel's Integral Perspective
Abstract Erwin Schadel (1946–2016), a central yet little‐known figure of the so‐called Bamberg School, developed a distinctive triadic ontology that deserves attention within the contemporary renaissance of Trinitarian thought. Drawing on Augustinian and Comenian sources, Schadel articulates a relational grammar of being through the categories of in ...
Matteo Raffaelli
wiley +1 more source
Generation of Werner-like states via a two-qubit system plunged in a thermal reservoir and their application in solving binary classification problems. [PDF]
Ghasemian E, Tavassoly MK.
europepmc +1 more source
In 1980, L. Adleman, C. Pomerance, and R. Rumely invented the first cyclotomicprimality test, and shortly after, in 1981, a simplified and more efficient versionwas presented by H.W. Lenstra for the Bourbaki Seminar.
Boucher, Thomas Francis
core

