Mathematics of Public Key Cryptography

From MaRDI portal
Publication:2880040


DOI10.1017/CBO9781139012843zbMath1238.94027WikidataQ61914025 ScholiaQ61914025MaRDI QIDQ2880040

Steven D. Galbraith

Publication date: 12 April 2012



11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

11Y16: Number-theoretic algorithms; complexity

14G50: Applications to coding theory and cryptography of arithmetic geometry

11-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory


Related Items

Cubic and Quartic Transformations of the Sixth Painlevé Equation in Terms of Riemann–Hilbert Correspondence, On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average, Short Generators Without Quantum Computers: The Case of Multiquadratics, A classification of slow convergence near parametric periodic points of discrete dynamical systems, Factoring multi-power RSA moduli with primes sharing least or most significant bits, Chiral polyhedra arising from almost simple groups with socle \(PSL(2,q)\), The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves, On the distribution of Atkin and Elkies primes, The pairing computation on Edwards curves, Computational hardness of IFP and ECDLP, Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors, Access structures of hyperelliptic secret sharing schemes, Recent progress on the elliptic curve discrete logarithm problem, 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, Computational problems in supersingular elliptic curve isogenies, The Rabin cryptosystem revisited, A theta model for elliptic curves, Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud, Distribution of elliptic twin primes in isogeny and isomorphism classes, Lattice-based identity-based resplittable threshold public key encryption scheme, On the Rabin Signature, The discrete logarithm problem for exponents of bounded height, Finding elliptic curves with a subgroup of prescribed size, Pairing Computation on Edwards Curves with High-Degree Twists