3 citations · 3 across the 4 of their papers we have counts for
5 papers
Embedding Integer Lattices as Ideals into Polynomial Rings
Yihang Cheng, Yansong Feng, Yanbin Pan
Many lattice-based crypstosystems employ ideal lattices for high efficiency. However, the additional algebraic structure of ideal lattices usually makes us worry about the security…
Generalized Implicit Factorization Problem
Yansong Feng, Abderrahmane Nitaj, Yanbin Pan
The Implicit Factorization Problem was first introduced by May and Ritzenhofen at PKC'09. This problem aims to factorize two RSA moduli and when their pri…
On Rangasamy's outsourcing algorithm for solving quadratic congruence equations
Xiulan Li, Yansong Feng, Yanbin Pan
Outsourcing computation is a desired approach for IoT (Internet of Things) devices to transfer their burdens of heavy computations to those nearby, resource-abundant cloud servers.…
On the ideal shortest vector problem over random rational primes
Yanbin Pan, Jun Xu, Nick Wadleigh +1
Any ideal in a number field can be factored into a product of prime ideals. In this paper we study the prime ideal shortest vector problem (SVP) in the ring …
A New Reduction from Search SVP to Optimization SVP
Gengran Hu, Yanbin Pan
It is well known that search SVP is equivalent to optimization SVP. However, the former reduction from search SVP to optimization SVP by Kannan needs polynomial times calls to the…