Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Blum integer"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Douglas Stebila, Bertram Poettering
Publikováno v:
International Journal of Information Security. 16:1-22
Digital signatures are often used by trusted authorities to make unique bindings between a subject and a digital object; for example, certificate authorities certify a public key belongs to a domain name, and time-stamping authorities certify that a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c66bc377160051a4fca14b372369447
https://doi.org/10.1007/s10207-015-0307-8
https://doi.org/10.1007/s10207-015-0307-8
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Márton Gyöngyvér
Publikováno v:
Tatra Mountains Mathematical Publications. 53:137-146
In this article a key encapsulation mechanism is presented which is based on squaring function, where the input element is from QR+N, where QR+N denotes the signed quadratic residue group, and N is a Blum integer. The article presents the soundness,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a203d082cb157f1b453a3b20633d98db
https://doi.org/10.2478/v10127-012-0043-7
https://doi.org/10.2478/v10127-012-0043-7
Publikováno v:
Communications of the Korean Mathematical Society. 25:167-171
We will show that if d is a cubefree integer and n is an integer, then with some suitable conditions, there are no primes p and a positive integer m such that d is a cubic residue (mod p), 3 | m, p || n if and only if there are integers x, y, z such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5842972458251cef1fd956ced3e4abc8
https://doi.org/10.4134/ckms.2010.25.2.167
https://doi.org/10.4134/ckms.2010.25.2.167
Autor:
Zheng-an Yao, Chunming Tang
Publikováno v:
Journal of Systems Science and Complexity. 22:260-279
Σ-protocol has been proved to be a very powerful cryptographic tool and widely used in numerous important cryptographic applications. In this paper, the authors make use of Σ-protocol as a main tool to resolve the following difficult problems 1–3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe19147eeccf03e29e959b92771f71a6
https://doi.org/10.1007/s11424-009-9162-x
https://doi.org/10.1007/s11424-009-9162-x
Autor:
Kailash Chandra Ray, Amit Kumar Panda
Publikováno v:
iNIS
Blum-Blum-Shub (x2 mod N) is proved cryptographically secure pseudorandom generator which passes all the statistical properties of randomness tests. It is secure, because it cannot predict in forward direction as well as in backward direction. The re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b777449b9acf996efe969d6444d7f02f
https://doi.org/10.1109/inis.2015.35
https://doi.org/10.1109/inis.2015.35
Publikováno v:
Information Security Applications ISBN: 9783319150864
WISA
WISA
Boneh, Gentry and Hamburg presented an encryption system known as BasicIBE without incorporating pairings. This system has short ciphertext size but this comes at the cost of less time-efficient encryption/decryption algorithms in which their process
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53915d9bfc92cc6aa1dc748ea2246f7b
https://doi.org/10.1007/978-3-319-15087-1_20
https://doi.org/10.1007/978-3-319-15087-1_20
Publikováno v:
Network and System Security ISBN: 9783319116976
NSS
NSS
In FOCS’07, Boneh, Gentry and Hamburg presented an identity-based encryption (IBE) system (BasicIBE) based on the quadratic residuosity (QR) assumption. A BasicIBE encryption of an l-bit message has a short ciphertext of log2 N + 2l bits where N is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5eda312ebced836fb7e1e03842cfa7b1
https://doi.org/10.1007/978-3-319-11698-3_21
https://doi.org/10.1007/978-3-319-11698-3_21