Results 31 to 40 of about 82,510 (316)
A factorization formula for power series [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Given an odd prime p, we give an explicit factorization over the ring of formal power series with integer coefficients for certain reducible polynomials whose constant term is of the form $p^w$ with $w>1$.
Daniel Birmajer +2 more
doaj +1 more source
A Practical Analysis of the Fermat Factorization and Pollard Rho Method for Factoring Integers
Lontar Komputer, 2021 The development of public-key cryptography generation using the factoring method is very important in practical cryptography applications. In cryptographic applications, the urgency of factoring is very risky because factoring can crack public and ...
Aminudin Aminudin, Eko Budi Cahyono
doaj +1 more source
Integer Factorization with a Neuromorphic Sieve
, 2018 The bound to factor large integers is dominated by the computational effort to discover numbers that are smooth, typically performed by sieving a polynomial sequence.
Monaco, John V., Vindiola, Manuel M.
core +1 more source
Algorithms for Positive Semidefinite Factorization
, 2017 This paper considers the problem of positive semidefinite factorization (PSD factorization), a generalization of exact nonnegative matrix factorization. Given an $m$-by-$n$ nonnegative matrix $X$ and an integer $k$, the PSD factorization problem consists
Gillis, Nicolas +2 more
core +1 more source
Linear Algebra and its Applications, 1991 The authors give conditions under which a rectangular integer matrix has an integer LU-factorization. They use a modified Gaussian elimination to find the LU-factorization and they consider such factorizations for adjacency matrices of trees.
Bevis, Jean H., Hall, Frank J.
openaire +1 more source
Cybernetics and Information Technologies, 2020 RSA is one among the most popular public key cryptographic algorithm for security systems. It is explored in the results that RSA is prone to factorization problem, since it is sharing common modulus and public key exponent.
Raghunandan K. R. +3 more
doaj +1 more source
Factorization in the Cloud: Integer Factorization Using F# and Windows Azure [PDF]
, 2011 Implementations are presented of two common algorithms for integer factorization, Pollard’s “p – 1” method and the SQUFOF method. The algorithms are implemented in the F# language, a functional programming language developed by Microsoft and officially ...
Shaffer, Ryan
core +1 more source
DAIMI Report Series, 1983 <p>This report gives a summary of methods for factoring large integers and presents particular factorizations obtained by these methods using the computer facilities at DAIMI.</p><p>We have used trial division, the continued fraction method, Pollard's methods, and various tests for primality to obtain new factorizations of Fibonacci ...
openaire +2 more sources
Prediction Model for Etiologic Differentiation of Isolated Vestibular Syndrome in Emergency Settings
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective This study aimed to develop and validate a predictive model for differentiating central from peripheral etiologies in patients with isolated vestibular syndrome (VS). Methods In this multicenter retrospective cohort study, 506 patients with isolated VS from five hospitals were divided into derivation (n = 301) and validation (n = 205)
Guo Wenting +12 more
wiley +1 more source
Note on Integer Factoring Methods IV [PDF]
, 2006 This note continues the theoretical development of deterministic integer factorization algorithms based on systems of polynomials equations. The main result establishes a new deterministic time complexity bench mark in integer factorization.Comment: 20 ...
Carella, N. A.
core +3 more sources