Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
Self Masking for Hardering Inversions.
Pawel Cyprys,
Shlomi Dolev
, Shlomo Moran
Department of Computer Science
Research output
:
Working paper/Preprint
›
Preprint
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Self Masking for Hardering Inversions.'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Polynomial Time
100%
Self-masking
100%
One-way Function
100%
Polynomial-time Algorithm
50%
Complexity Theory
50%
Random Inputs
50%
Simple Heuristics
50%
Large Integers
50%
Computable Function
50%
Subset Sum Problem
50%
Generalized Inverse
50%
Computer Science
Efficient Algorithm
100%
Polynomial Time
100%
Polynomial Time Algorithm
50%
Time Computable Function
50%
Mathematics
Polynomial Time
100%
One-Way Function
66%
Integer
33%
Random Input
33%
Subset Sum
33%
Time Computable Function
33%