An Introduction to Mathematical Cryptography

From MaRDI portal
Revision as of 11:51, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5459445

DOI10.1007/978-0-387-77993-5zbMath1160.94001OpenAlexW4298107213MaRDI QIDQ5459445

Jill Pipher, Joseph H. Silverman, Jeffrey Hoffstein

Publication date: 28 April 2008

Published in: Undergraduate Texts in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-77993-5




Related Items

Complexity analysis of a top down algorithm motivated by power product expansionsDictionary based codes involving power product expansionsDictionary coding via perfect polynomialsThe soft graphic integer sub-decomposition method for elliptic scalar multiplicationThe elliptic scalar multiplication graph and its application in elliptic curve cryptographyAUTHENTICATED TRIPARTITE KEY AGREEMENT PROTOCOL USING DIGITAL SIGNATURE ALGORITHMGroup ring based public key cryptosystemsImproved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary groupA deterministic algorithm for the discrete logarithm problem in a semigroupA Public Key Cryptosystem Using Hiil's CipherComputational Number Theory and CryptographyA non-commutative cryptosystem based on quaternion algebrasIsogenies of abelian varieties over finite fieldsPASS-encrypt: a public key cryptosystem based on partial evaluation of polynomialsProvably secure proxy signature scheme from factorizationEfficient Nyberg-Rueppel type of NTRU digital signature algorithmNew orthogonality criterion for shortest vector of lattices and its applications$$\mathsf {HIKE}$$ : Walking the Privacy TrailA key agreement protocol based on spiking neural P systems with anti-spikesSecurity considerations for Galois non-dual RLWE familiesFault analysis of the NTRUSign digital signature schemeStorage efficient algorithm for Hermite normal form using LLLETRU: NTRU over the Eisenstein integersCryptanalysis of the Knapsack GeneratorUnnamed ItemCryptanalysis of Dual RSADeciphering an Undergraduate Cryptology CourseUnnamed ItemNTRU over rings beyond \(\mathbb{Z}\)An experimental comparison of some LLL-type lattice basis reduction algorithmsCryptanalysis of a Matrix-based MOR SystemTowards Optimal Bounds for Implicit Factorization ProblemSymmetric cryptoalgorithms in the residue number systemFast projective synchronization of fractional order chaotic and reverse chaotic systems with its application to an affine cipher using date of birth (DOB)Automorphisms of types and their applicationsLifting and Elliptic Curve Discrete LogarithmsOn the Rabin SignatureSatins, lattices, and extended Euclid's algorithmResidue number system asymmetric cryptoalgorithmsThe Rabin cryptosystem revisitedSome remarks on the oscillator group




This page was built for publication: An Introduction to Mathematical Cryptography