REVIEW 1 cited by
On a new fast public key cryptosystem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
This paper presents a new fast public key cryptosystem namel : a key exchange algorithm, a public key encryption algorithm and a digital signature algorithm, based on the difficulty to invert the following function: $$F(x) =(a\times x)Mod(2^p)Div(2^q).$$ Mod is modulo operation , Div is integer division operation , a , p and q are integers where $( p > q )$. We define p and q values for which ModDiv2Inv can be the hardest. We then present ModDiv2Kex, a new fast key exchange algorithm based on ModDiv2Inv. In this paper we also evaluate the hardness of this problem by reducing it to SAT .
Forward citations
Cited by 1 Pith paper
-
DSA Nonce Vulnerabilities: An Interactive Analysis
A new interactive Tkinter/PyCryptodome/SageMath tool visualises DSA signing, verification, and nonce-reuse, linear-nonce, and HNP/LLL key-recovery attacks, passing its own functional and performance tests.
Discussion (0). Continue with ORCID to comment.