Computational Number Theory and Cryptography

DOI10.1007/978-3-319-04720-1_22zbMath1312.94079OpenAlexW205677880MaRDI QIDQ2926150

Preda Mihaĭlescu, Michael Th. Rassias

Publication date: 30 October 2014

Published in: Applications of Mathematics and Informatics in Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04720-1_22

zbMATH Keywords

cryptographyquantum cryptographypublic key cryptographyelliptic curve cryptographycomputational number theory

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Factorization (11Y05) Quantum coding (general) (81P70)

Related Items (1)

Weak pseudoprimality associated with the generalized Lucas sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The magic of elliptic curves and public-key cryptography
• Complexity classes as mathematical axioms
• Group-based cryptography
• Elliptic Gauss sums and applications to point counting
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Factoring integers with elliptic curves
• The two-eigenvalue problem and density of Jones representation of braid groups.
• Simulation of topological field theories by quantum computers
• A modular functor which is universal for quantum computation
• Counting points on elliptic curves over finite fields
• Public key cryptography, number theory and applications
• McBits: Fast Constant-Time Code-Based Cryptography
• A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
• Fast algorithms for computing isogenies between elliptic curves
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Elliptic Curve Cryptosystems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Topological quantum computation
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• An Introduction to Mathematical Cryptography
• Approximate Counting and Quantum Computation

This page was built for publication: Computational Number Theory and Cryptography