On a method for solving the equation _h=0ⁿc_hx^n-hy^h=P in integers.
From MaRDI portal
Publication:1491668
(Vgl. F. d. M. 38, 246, 1907, JFM 38.0246.02). Der Verf. sucht die Lösung der linearen Gleichung \(ax+by=1\) mittels Kettenbrüche auch auf die Form \(n\)-ten Grades \[ \sum_{h=0}^{n}c_hx^{n-h}y^h=P \] auszudehnen, indem er zunächst die Kongruenz löst: \[ \sum_{h=0}^{n}c_hx^{n-h}y^h=0\;(\text{mod.\,} P). \]
Cited in
(10)- \textsf{FESTA}: fast encryption from supersingular torsion attacks
- SQIsignHD: new dimensions in cryptography
- Simple power analysis attack on SQIsign
- Computing the endomorphism ring of a supersingular elliptic curve from a full rank suborder
- Fast computation of 2-isogenies in dimension 4 and cryptographic applications
- Avoiding trusted setup in isogeny-based commitments
- Investigating integer solutions to quadratic Diophantine equations using quadratic residues
- On the efficient representation of isogenies. A survey for NuTMiC 2024
- \textsf{Qlapoti}: simple and efficient translation of quaternion ideals to isogenies
- KLaPoTi: an asymptotically efficient isogeny group action from 2-dimensional isogenies
This page was built for publication: On a method for solving the equation \(\sum_{h=0}^{n}c_hx^{n-h}y^h=P\) in integers.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1491668)
