Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Seongan Lim"'
Publikováno v:
Discrete Applied Mathematics. 294:31-40
Recently, Yu et al. presented an algorithm for a canonic DBC of a positive integer n by solving certain subproblems recursively and it requires O ( ( log n ) 2 log log n ) bit operations and O ( ( log n ) 2 ) bits of memory. This is currently the mos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a90bada9b199ba39ba5ec71746e23e8
https://doi.org/10.1016/j.dam.2021.01.023
https://doi.org/10.1016/j.dam.2021.01.023
Publikováno v:
Linear Algebra and its Applications. 613:183-200
Computing HNF has a long history, but designing a storage efficient algorithm is a challenging issue for matrices of large sizes. One of the main challenges in the design of storage efficient HNF algorithm is to control the rank and the size of the i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd85d4d20e7c5c85b5df87d82c70ca0b
https://doi.org/10.1016/j.laa.2020.12.022
https://doi.org/10.1016/j.laa.2020.12.022
Publikováno v:
Fundamenta Informaticae. 177:115-139
In LATTE, a lattice based hierarchical identity-based encryption (HIBE) scheme, each hierarchical level user delegates a trapdoor basis to the next level by solving a generalized NTRU equation of level ℓ ≥ 3. For ℓ = 2, Howgrave-Graham, Pipher,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0374179206bf72d516c0ef64b302c63f
https://doi.org/10.3233/fi-2020-1982
https://doi.org/10.3233/fi-2020-1982
Publikováno v:
Discrete Applied Mathematics. 283:323-335
The security of most lattice based cryptography relies on the hardness of computing a shortest nonzero vector of lattices. We say that a lattice basis is SV-reduced if it contains a shortest nonzero vector of the lattice. In this paper, we prove that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff774c32bd50a3296283840a7a06bce6
https://doi.org/10.1016/j.dam.2020.01.023
https://doi.org/10.1016/j.dam.2020.01.023
Publikováno v:
Electronic Notes in Discrete Mathematics. 71:9-14
For a lattice, finding a nonzero shortest vector is computationally difficult in general. The problem becomes quite complicated even when the dimension of the lattice is five. There are two related notions of reduced bases, say, Minkowski-reduced bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee1b81b067d34d67be0f7c62fea67750
https://doi.org/10.1016/j.endm.2019.02.002
https://doi.org/10.1016/j.endm.2019.02.002
Publikováno v:
Security and Communication Networks, Vol 2018 (2018)
The notion of key substitution security on digital signatures in the multiuser setting has been proposed by Menezes and Smart in 2004. Along with the unforgeability of signature, the key substitution security is very important since it is a critical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00ab80193d10cadae64b8bc4d0c5e7f6
https://doi.org/10.1155/2018/8525163
https://doi.org/10.1155/2018/8525163
Publikováno v:
Finite Fields and Their Applications. 48:430-446
In the public key cryptography, we say that two public keys are duplicated if they share a private key in common. We point out that no duplicate public keys exist in the RSA public key scheme since there is a one-to-one correspondence between the set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0545f1e8d8df45f790c8e0ece5b5bab
https://doi.org/10.1016/j.ffa.2017.09.001
https://doi.org/10.1016/j.ffa.2017.09.001
Publikováno v:
Security and Communication Networks, Vol 2017 (2017)
SECURITY AND COMMUNICATION NETWORKS
SECURITY AND COMMUNICATION NETWORKS
Tian and Huang proposed a lattice-based CLS scheme based on the hardness of the SIS problem and proved, in the random oracle model, that the scheme is existentially unforgeable against strong adversaries. Their security proof uses the general forking
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa222966f0e156238dd2484634aa124e
https://doi.org/10.1155/2017/3413567
https://doi.org/10.1155/2017/3413567
Publikováno v:
Discrete Applied Mathematics. 214:88-98
In this paper, we propose a lattice reduction algorithm for use with NTRU lattices. Given an NTRU lattice as its input, the algorithm computes an LLL-reduced basis. The proposed lattice reduction algorithm is more efficient than the classical LLL alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21fbd5fe3678adbce3f16ab9e17eddb9
https://doi.org/10.1016/j.dam.2016.05.029
https://doi.org/10.1016/j.dam.2016.05.029