On a family of preimage-resistant functions (Q3075868): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Attila Bérczes / rank
 
Normal rank
Property / author
 
Property / author: Attila Pethoe / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986195254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation for a fast public-key cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of a Hash Function Based on Norm Form Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-II Optimal Polynomial Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials Over Large Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-way function based on norm form equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of index forms in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved explicit estimates on the number of solutions of equations over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Factoring Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: VSH, an Efficient and Provable Collision-Resistant Hash Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing 1-1 One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Massey-Omura parallel multiplier for a class of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of factoring bivariate supersparse (Lacunary) polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of Points of Varieties in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast software one-way hash function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Software Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Errata to "On reducible trinomials" (Dissertationes Mathematicae 329 (1993)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reducible trinomials. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the number of solutions of equations over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number theoretic methods in cryptography. Complexity lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient optimal normal basis type II multiplier / rank
 
Normal rank

Latest revision as of 19:21, 3 July 2024

scientific article
Language Label Description Also known as
English
On a family of preimage-resistant functions
scientific article

    Statements

    On a family of preimage-resistant functions (English)
    0 references
    0 references
    0 references
    0 references
    17 February 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references