Zobrazeno 1 - 10
of 146
pro vyhledávání: '"Neal Koblitz"'
Publikováno v:
Journal of Mathematical Cryptology. 16:98-102
Rahman and Shpilrain proposed a Diffie–Hellman style key exchange based on a semidirect product of n × n n\times n -matrices over a finite field. We show that, using public information, an adversary can recover the agreed upon secret key by solvin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06806de090c5f5a3e02ea7969b121eb9
https://doi.org/10.1515/jmc-2021-0016
https://doi.org/10.1515/jmc-2021-0016
Publikováno v:
Advances in Mathematics of Communications.
A seminal 2013 paper by Lyubashevsky, Peikert, and Regev proposed basing post-quantum cryptography on ideal lattices and supported this proposal by giving a polynomial-time security reduction from the approximate Shortest Independent Vectors Problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e3d034655f236b37e4a5312050d23ea
https://doi.org/10.3934/amc.2022082
https://doi.org/10.3934/amc.2022082
Autor:
Neal Koblitz
This introduction to recent work in p-adic analysis and number theory will make accessible to a relatively general audience the efforts of a number of mathematicians over the last five years. After reviewing the basics (the construction of p-adic num
Autor:
Max McDonald, Neal Koblitz
Publikováno v:
The Mathematical Intelligencer. 41:27-34
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3cd698a6335f27f741d9d3b1e4814ce
https://doi.org/10.1007/s00283-019-09878-8
https://doi.org/10.1007/s00283-019-09878-8
Autor:
Neal Koblitz, Alfred Menezes
Publikováno v:
Advances in Mathematics of Communications. 13:517-558
We give an overview of our critiques of "proofs" of security and a guide to our papers on the subject that have appeared over the past decade and a half. We also provide numerous additional examples and a few updates and errata.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90daad5c0d78447d301351ca1d9dd8cc
https://doi.org/10.3934/amc.2019034
https://doi.org/10.3934/amc.2019034
Autor:
Neal Koblitz, Phan Dương Hiệu
Publikováno v:
Cryptologia
Cryptologia, Taylor & Francis, 2017, 41 (6), pp.491-511. ⟨10.1080/01611194.2017.1292825⟩
Cryptologia, Taylor & Francis, 2017, 41 (6), pp.491-511. ⟨10.1080/01611194.2017.1292825⟩
After Vietnam’s Declaration of Independence on 2 September 1945, the country had to suffer through two long, brutal wars, first against the French and then against the Americans, before finally bec...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4beab6b29fe2e9a6a962b08f03e84138
https://doi.org/10.1080/01611194.2017.1292825
https://doi.org/10.1080/01611194.2017.1292825
Autor:
Neal Koblitz, Alfred Menezes
Publikováno v:
Designs, Codes and Cryptography. 78:87-102
One of the central challenges for mathematical cryptography is to create a payment system that provides the advantages of cash in a digital world. In this expository article we describe two very different solutions to this problem. The first is an el
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3477f3ec97bbedac235af06be09b6dbe
https://doi.org/10.1007/s10623-015-0148-5
https://doi.org/10.1007/s10623-015-0148-5
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319612720
Mycrypt
Mycrypt
How to deal with large tightness gaps in security proofs is a vexing issue in cryptography. Even when analyzing protocols that are of practical importance, leading researchers often fail to treat this question with the seriousness that it deserves. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfc9d8009af4f81d3371e052bfc32adf
https://igi.indrastra.com/items/show/188760
https://igi.indrastra.com/items/show/188760
Autor:
Neal Koblitz
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319612720
Mycrypt
Mycrypt
The well-known KISS principle of engineering — Keep It Simple, Stupid! — is also of value in cryptography. In certain subfields, such as lattice-based crypto and indistinguishability obfuscation, the proposed constructions pay little heed to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67283979df01623ba7c3ce8860904bff
https://doi.org/10.1007/978-3-319-61273-7_2
https://doi.org/10.1007/978-3-319-61273-7_2
Autor:
Neal Koblitz, Alfred Menezes
Publikováno v:
Journal of Mathematical Cryptology, Vol 7, Iss 3, Pp 225-251 (2013)
HMAC is the most widely-deployed cryptographic-hash-function-based message authentication code. First, we describe a security issue that arises because of inconsistencies in the standards and the published literature regarding keylength. We prove a s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::32947ac78c80c9bf077200bddb89b82f
https://doaj.org/article/97813ac8482a4ba9b7ae84a7d406c784
https://doaj.org/article/97813ac8482a4ba9b7ae84a7d406c784