An Introduction to Mathematical Cryptography
From MaRDI portal
Recommendations
Cited in
(67)- Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
- A non-commutative cryptosystem based on quaternion algebras
- Security considerations for Galois non-dual RLWE families
- Provably secure proxy signature scheme from factorization
- Fault analysis of the NTRUSign digital signature scheme
- Symmetric cryptoalgorithms in the residue number system
- Satins, lattices, and extended Euclid's algorithm
- Residue number system asymmetric cryptoalgorithms
- A deterministic algorithm for the discrete logarithm problem in a semigroup
- New orthogonality criterion for shortest vector of lattices and its applications
- Storage efficient algorithm for Hermite normal form using LLL
- A course in mathematical cryptography
- Automorphisms of types and their applications
- The Rabin cryptosystem revisited
- Some remarks on the oscillator group
- Cryptanalysis of a matrix-based MOR system
- Towards optimal bounds for implicit factorization problem
- On the Rabin Signature
- An introduction to public-key cryptography
- Course in algebra and algorithmics. Applications to RSA and to discrete logarithm cryptology
- An introduction to mathematical cryptography
- Mathematics of public key cryptography.
- Computational Number Theory and Cryptography
- Mathematical foundations of public key cryptography
- Cryptanalysis of the knapsack generator
- Deciphering an Undergraduate Cryptology Course
- Public-key cryptanalysis
- Lifting and Elliptic Curve Discrete Logarithms
- scientific article; zbMATH DE number 682387 (Why is no real title available?)
- ETRU: NTRU over the Eisenstein integers
- Introduction to cryptography with Maple
- Fundamentals of Cryptography
- Complexity analysis of a top down algorithm motivated by power product expansions
- Dictionary based codes involving power product expansions
- Dictionary coding via perfect polynomials
- The soft graphic integer sub-decomposition method for elliptic scalar multiplication
- The elliptic scalar multiplication graph and its application in elliptic curve cryptography
- AUTHENTICATED TRIPARTITE KEY AGREEMENT PROTOCOL USING DIGITAL SIGNATURE ALGORITHM
- Group ring based public key cryptosystems
- On pairwise Gaussian bases and LLL algorithm for three dimensional lattices
- A Public Key Cryptosystem Using Hiil's Cipher
- scientific article; zbMATH DE number 7528065 (Why is no real title available?)
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm
- Cryptographic Primitives in Blockchain Technology
- Cryptanalysis of Dual RSA
- Modern cryptography with proof techniques and implementations
- $$\mathsf {HIKE}$$ : Walking the Privacy Trail
- A key agreement protocol based on spiking neural P systems with anti-spikes
- Introduction to Cryptography
- Implementation of extended generalized Fibonacci matrices as a key in modified elliptic curve cryptography
- Discriminants of number fields
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Multivariate exponential equations with unknown coefficients
- Nonlinear Diophantine equations in cryptography algebraic approaches to post-quantum security
- Lower bounds for the height of rational points of elliptic curves
- An efficient noncommutative NTRU from semidirect product
- Matrix projective combination synchronization of time-delayed chaotic system and its application in image encryption
- DiTRU: a resurrection of NTRU over dihedral group
- A cryptography using lifting scheme integer wavelet transform over min-max-plus algebra.
- An experimental comparison of some LLL-type lattice basis reduction algorithms
- Cryptanalysis of an outsourced modular inversion protocol
- A quantum secure ID-based cryptographic encryption based on group rings
- A knapsack McEliece-based public key cryptosystem
- Fast projective synchronization of fractional order chaotic and reverse chaotic systems with its application to an affine cipher using date of birth (DOB)
- Isogenies of abelian varieties over finite fields
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
- NTRU over rings beyond \(\mathbb{Z}\)
This page was built for publication: An Introduction to Mathematical Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459445)