New number-theoretic cryptographic primitives
DOI10.1515/jmc-2019-0035zbMath1465.94059OpenAlexW2984268733WikidataQ114845839 ScholiaQ114845839MaRDI QIDQ2023304
Marc Joye, David Naccache, Éric Brier, Houda Ferradi
Publication date: 3 May 2021
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2019-0035
cryptographic primitivesnumber theorydigital signaturesone-way functions\(p^rq\) moduli\(r\)-th order imprint\(r\)-th power residue symbol
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Cyclotomic extensions (11R18) Power residues, reciprocity (11A15)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring integers with elliptic curves
- Factoring polynomials with rational coefficients
- Efficient signature generation by smart cards
- Fast computation of the biquadratic residue symbol.
- A public-key cryptosystem utilizing cyclotomic fields
- The Euclidean algorithm in algebraic number fields
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
- On pseudorandomness in families of sequences derived from the Legendre symbol
- A New Rabin-type Trapdoor Permutation Equivalent to Factoring
- AN EFFICIENT SEVENTH POWER RESIDUE SYMBOL ALGORITHM
- Digital Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- New directions in cryptography
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- Euclid's Algorithm in Cyclotomic Fields
- A method for obtaining digital signatures and public-key cryptosystems
- Foundations of Cryptography
- Progress in Cryptology – Mycrypt 2005
- Public Key Cryptography – PKC 2004
- Advances in Cryptology - ASIACRYPT 2003
- Construction of large families of pseudorandom binary sequences
- Selecting cryptographic key sizes
This page was built for publication: New number-theoretic cryptographic primitives