1. Introduction. A central problem in cryptography is to establish the existence of one-way functions. Such a function would have the property that, while it is computable in polynomial …
M Anshel, D Goldfeld - Duke Math. J., 1997 - dml.mathdoc.fr
Zeta functions, one-way functions, and pseudorandom number generators logo dml Revues Livres Sources Tout Tout Auteur Titre Bibliographie Inclure les e-prints dans la recherche (arXiv …
New candidate one–way functions which arise from the intractable problem of determining a zeta function from its initial Dirichlet coefficients are presented. This intractable problem …
New candidate one–way functions which arise from the intractable problem of determining a zeta function from its initial Dirichlet coefficients are presented. This intractable problem …