Mathematics of public key cryptography.
From MaRDI portal
algorithmic number theoryelliptic curvesfactorization methodshash functionshyperelliptic curveslatticesprimality testspublic-key cryptography
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)
Recommendations
Cited in
(only showing first 100 items - show all)- Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction
- Quantum lattice enumeration and tweaking discrete pruning
- On the hardness of the computational ring-LWR problem and its applications
- On the statistical leak of the GGH13 multilinear map and some variants
- Distorting the volcano
- Towards practical key exchange from ordinary isogeny graphs
- CSIDH: an efficient post-quantum commutative group action
- Computing supersingular isogenies on Kummer surfaces
- Efficient post-quantum undeniable signature on 64-bit ARM
- Volumes and distributions for random unimodular complex and quaternion lattices
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
- Information security, mathematics, and public-key cryptography
- Extending the GLS endomorphism to speed up GHS Weil descent using Magma
- Computational problems in supersingular elliptic curve isogenies
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Analysis of DeepBKZ reduction for finding short lattice vectors
- Geometry of biquadratic and cyclic cubic log-unit lattices
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- Computing projective equivalences of planar curves birationally equivalent to elliptic and hyperelliptic curves
- Lattice size and generalized basis reduction in dimension three
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
- Trisections on certain rational elliptic surfaces and families of Zariski pairs degenerating to the same conic-line arrangement
- Rational \(D(q)\)-quadruples
- A deterministic algorithm for finding \(r\)-power divisors
- Linear complexity of sequences on Koblitz curves of genus 2
- An explicit construction for \(n\)-contact curves to a smooth cubic via divisions of polynomials and Zariski tuples
- Detecting affine equivalences between implicit planar algebraic curves
- Hashing to elliptic curves of \(j\)-invariant 1728
- Optimum attack on 3-round Feistel-2 structure
- Linear complexity of some sequences derived from hyperelliptic curves of genus 2
- The Elekes-Szabó problem and the uniformity conjecture
- Divisibility by 2 on quartic models of elliptic curves and rational Diophantine \(D(q)\)-quintuples
- A new approach for finding low-weight polynomial multiples
- A new adaptive attack on SIDH
- Reusing nonces in Schnorr signatures (and keeping it secure...)
- The polynomial learning with errors problem and the smearing condition
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- Linear forms in logarithms and the mathematical method of Diophantine equations: applications in chemistry and physics
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- A note on isotropic discrepancy and spectral test of lattice point sets
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- The Rabin cryptosystem revisited
- A theta model for elliptic curves
- Improved complexity bounds for counting points on hyperelliptic curves
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
- Distribution of elliptic twin primes in isogeny and isomorphism classes
- Discrete algebraic methods. Arithmetic, cryptography, automata and groups
- Objective molecular dynamics for atomistic simulation of macroscopic fluid motion
- Differential addition on binary elliptic curves
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- SiGamal: a supersingular isogeny-based PKE and its application to a PRF
- Lattice-based identity-based resplittable threshold public key encryption scheme
- On the Rabin Signature
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- An introduction to public-key cryptography
- The discrete logarithm problem for exponents of bounded height
- An introduction to mathematical cryptography
- Computational Number Theory and Cryptography
- Mathematical foundations of public key cryptography
- Chiral polyhedra arising from almost simple groups with socle \(PSL(2,q)\)
- Computational Number Theory and Modern Cryptography
- Finding elliptic curves with a subgroup of prescribed size
- The Q-curve construction for endomorphism-accelerated elliptic curves
- Analytical methods for fast converging lattice sums for cubic and hexagonal close-packed structures
- Pairing computation on Edwards curves with high-degree twists
- An exposition of the mathematics expected of cryptographic chips
- The arithmetic behind cryptography
- On the distribution of Atkin and Elkies primes
- The pairing computation on Edwards curves
- Cubic and quartic transformations of the sixth Painlevé equation in terms of Riemann-Hilbert correspondence
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- On the sequences ri, si, ti ∈ ℤ related to extended Euclidean algorithm and continued fractions
- Improved supersingularity testing of elliptic curves
- Digital signatures
- Computational hardness of IFP and ECDLP
- Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728
- A generalization of the ElGamal public-key cryptosystem
- A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
- Conditional reconstruction of affine open subschemes of elliptic curves in positive characteristic by their geometric fundamental groups
- A parametric version of LLL and some consequences: parametric shortest and closest vector problems
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors
- Supersingular isogeny-based cryptography: a survey
- Hasse-Witt and Cartier-Manin matrices: a warning and a request
- On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average
- An Introduction to Mathematical Cryptography
- scientific article; zbMATH DE number 2231488 (Why is no real title available?)
- Short generators without quantum computers: the case of multiquadratics
- A classification of slow convergence near parametric periodic points of discrete dynamical systems
- Explicit classification of isogeny graphs of rational elliptic curves
- SHealS and HealS: Isogeny-Based PKEs from a Key Validation Method for SIDH
- Proving knowledge of isogenies: a survey
- A more complete analysis of the signal double ratchet algorithm
- Finding low-weight polynomial multiples using the rho method
- An innovative approach towards image encryption by using novel PRNs and S-boxes modeling techniques
- The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- The "Elliptic" matrices and a new kind of cryptography
- An approximation algorithm for indefinite mixed integer quadratic programming
- The probability of non-isomorphic group structures of isogenous elliptic curves in finite field extensions. I
- An analysis of the algebraic group model
This page was built for publication: Mathematics of public key cryptography.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880040)
