New number-theoretic cryptographic primitives
From MaRDI portal
It is known that factoring unbalanced integers, e.g. integers of the form \(n = {p^r}q\), \(p\), \(q\)-primes is easy if \(r\) is large, but for small values of \(r\) the task seems to be as hard as in the general case. Thus, a new family of one-way functions and signature schemes based on this fact is introduced, e.g. for signing a document signer generates multiple moduli \({n_i} = p_i^2{q_i}\) using secret primes \({p_i}\), \({q_i}\). The signature is a bounded-size prime whose Jacobi symbols with respect to the \({n_i}\)s match the message digest.
Recommendations
- scientific article; zbMATH DE number 2123741
- scientific article; zbMATH DE number 5821921
- Number theoretic methods in cryptography. Complexity lower bounds
- Computational Number Theory and Modern Cryptography
- scientific article; zbMATH DE number 1786488
- Number theory and applications in cryptography
- scientific article; zbMATH DE number 4214160
- scientific article; zbMATH DE number 707175
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A method for obtaining digital signatures and public-key cryptosystems
- A new Rabin-type trapdoor permutation equivalent to factoring
- A public-key cryptosystem utilizing cyclotomic fields
- An efficient seventh power residue symbol algorithm
- Construction of large families of pseudorandom binary sequences
- Digital Signatures
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
- Efficient signature generation by smart cards
- Euclid's Algorithm in Cyclotomic Fields
- Factoring integers with elliptic curves
- Factoring polynomials with rational coefficients
- Fast computation of the biquadratic residue symbol.
- Foundations of Cryptography
- Generalized powering functions and their application to digital signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3991413 (Why is no real title available?)
- scientific article; zbMATH DE number 47996 (Why is no real title available?)
- scientific article; zbMATH DE number 177609 (Why is no real title available?)
- scientific article; zbMATH DE number 1302856 (Why is no real title available?)
- scientific article; zbMATH DE number 1303131 (Why is no real title available?)
- scientific article; zbMATH DE number 475430 (Why is no real title available?)
- scientific article; zbMATH DE number 1122449 (Why is no real title available?)
- scientific article; zbMATH DE number 1942415 (Why is no real title available?)
- scientific article; zbMATH DE number 1952903 (Why is no real title available?)
- scientific article; zbMATH DE number 2081059 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- scientific article; zbMATH DE number 1418303 (Why is no real title available?)
- scientific article; zbMATH DE number 967875 (Why is no real title available?)
- scientific article; zbMATH DE number 4187706 (Why is no real title available?)
- New directions in cryptography
- On pseudorandomness in families of sequences derived from the Legendre symbol
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- Progress in Cryptology – Mycrypt 2005
- Public Key Cryptography – PKC 2004
- Selecting cryptographic key sizes
- The Euclidean algorithm in algebraic number fields
Cited in
(9)- The eleventh power residue symbol
- Extended Galbraith's test on the anonymity of IBE schemes from higher residuosity
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- scientific article; zbMATH DE number 67086 (Why is no real title available?)
- scientific article; zbMATH DE number 7526290 (Why is no real title available?)
- Generalized powering functions and their application to digital signatures
- The one-wayness of Jacobi signatures
- Higher residuosity attacks on small RSA subgroup decision problems
- The least primitive roots mod p
This page was built for publication: New number-theoretic cryptographic primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2023304)
