Parallel Integer Factorization Using Quadratic Forms

2005 ◽  
Author(s):  
Stephen S. McMath
Keyword(s):  
Quadratic Forms ◽  
Integer Factorization

Existence

2017 ◽  
Author(s):  
Bernhard M¨uhlherr ◽  
Holger P. Petersson ◽  
Richard M. Weiss
Keyword(s):  
Division Algebra ◽  
Quadratic Forms ◽  
Structure Theorem ◽  
Quadratic Extension ◽  
Quadratic Space ◽  
Division Algebras ◽  
Separable Extension ◽  
Valued Fields ◽  
Quaternion Division Algebra

This chapter proves that Bruhat-Tits buildings exist. It begins with a few definitions and simple observations about quadratic forms, including a 1-fold Pfister form, followed by a discussion of the existence part of the Structure Theorem for complete discretely valued fields due to H. Hasse and F. K. Schmidt. It then considers the generic unramified cases; the generic semi-ramified cases, the generic ramified cases, the wild unramified cases, the wild semi-ramified cases, and the wild ramified cases. These cases range from a unique unramified quadratic space to an unramified separable quadratic extension, a tamely ramified division algebra, a ramified separable quadratic extension, and a unique unramified quaternion division algebra. The chapter also describes ramified quaternion division algebras D₁, D₂, and D₃ over K containing a common subfield E such that E/K is a ramified separable extension.

Totally Wild Quadratic Forms of Type E7

2017 ◽  
Author(s):  
Bernhard M¨uhlherr ◽  
Holger P. Petersson ◽  
Richard M. Weiss
Keyword(s):  
Division Algebra ◽  
Quadratic Forms ◽  
Quadratic Space ◽  
Trace Map ◽  
Quaternion Division Algebra

This chapter assumes that (K, L, q) is a totally wild quadratic space of type E₇. The goal is to prove the proposition that takes into account Λ‎ of type E₇, D as the quaternion division algebra over K whose image in Br(K) is the Clifford invariant of q, and the trace and trace map. The chapter also considers two other propositions: the first states that if the trace map is not equal to zero, then the Moufang residues R₀ and R₁ are not indifferent; the second states that if the trace map is equal to zero, then the Moufang residues R₀ and R₁ are both indifferent.

Linked Tori, II

2017 ◽  
Author(s):  
Bernhard M¨uhlherr ◽  
Holger P. Petersson ◽  
Richard M. Weiss
Keyword(s):  
Division Algebra ◽  
Quadratic Forms ◽  
Integral Domain ◽  
Quadratic Space ◽  
Small Observation ◽  
Quaternion Division Algebra

This chapter proves several more results about weak isomorphisms between Moufang sets arising from quadratic forms and involutory sets. It first fixes a non-trivial anisotropic quadratic space Λ‎ = (K, L, q) before considering two proper anisotropic pseudo-quadratic spaces. It then describes a quaternion division algebra and its standard involution, a second quaternion division algebra and its standard involution, and an involutory set with a quaternion division algebra and its standard involution. It concludes with one more small observation regarding a pointed anisotropic quadratic space and shows that there is a unique multiplication on L that turns L into an integral domain with a multiplicative identity.

Optimal importance sampling for some quadratic forms of ARMA processes

1995 ◽  
Vol 41 (6) ◽  
pp. 1834-1844 ◽  
Author(s):  
P. Barone ◽  
A. Gigli ◽  
M. Piccioni
Keyword(s):  
Importance Sampling ◽  
Quadratic Forms ◽  
Arma Processes

scholarly journals Hyers-Ulam stability of quadratic forms in 2-normed spaces

2019 ◽  
Vol 52 (1) ◽  
pp. 496-502
Author(s):  
Won-Gil Park ◽  
Jae-Hyeong Bae
Keyword(s):  
Banach Spaces ◽  
Quadratic Forms ◽  
Functional Equations ◽  
Ulam Stability ◽  
Normed Spaces

AbstractIn this paper, we obtain Hyers-Ulam stability of the functional equationsf (x + y, z + w) + f (x − y, z − w) = 2f (x, z) + 2f (y, w),f (x + y, z − w) + f (x − y, z + w) = 2f (x, z) + 2f (y, w)andf (x + y, z − w) + f (x − y, z + w) = 2f (x, z) − 2f (y, w)in 2-Banach spaces. The quadratic forms ax2 + bxy + cy2, ax2 + by2 and axy are solutions of the above functional equations, respectively.

Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem

2021 ◽  
Vol 31 (1) ◽  
pp. 1-4
Author(s):  
Mikhail A. Cherepnev
Keyword(s):  
Upper Bound ◽  
Polynomial Algorithm ◽  
Integer Factorization ◽  
Factorization Problem ◽  
Diffie Hellman ◽  
Integer Factorization Problem

Abstract We construct a probabilistic polynomial algorithm that solves the integer factorization problem using an oracle solving the Diffie–Hellman problem.

Sign in / Sign up

Export Citation Format

Share Document