default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasaya Yasuda
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c38]Akira Katayama, Masaya Yasuda:
Computing a Basis of the Set of Isogenies Between Two Supersingular Elliptic Curves. CASC 2024: 178-192- [c37]Arata Sato, Aurélien Auzemery, Akira Katayama, Masaya Yasuda:
Experimental Analysis of Integer Factorization Methods Using Lattices. IWSEC 2024: 142-157 - 2022
- [j19]Satoshi Nakamura, Nariaki Tateiwa, Masaya Yasuda
, Katsuki Fujisawa:
Solving the search-LWE problem over projected lattices. Discret. Appl. Math. 318: 69-81 (2022) - 2021
- [j18]Satoshi Nakamura, Masaya Yasuda:
Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation. Discret. Appl. Math. 304: 220-229 (2021) - [j17]Pradeep Kumar Mishra, Deevashwer Rathee, Dung Hoang Duong, Masaya Yasuda:
Fast secure matrix multiplications over ring-based homomorphic encryption. Inf. Secur. J. A Glob. Perspect. 30(4): 219-234 (2021) - [j16]Yasushi Takahashi, Momonari Kudo, Ryoya Fukasaku, Yasuhiko Ikematsu, Masaya Yasuda, Kazuhiro Yokoyama:
Algebraic approaches for solving isogeny problems of prime power degrees. J. Math. Cryptol. 15(1): 31-44 (2021) - [c36]Nariaki Tateiwa, Yuji Shinano, Keiichiro Yamamura, Akihiro Yoshida, Shizuo Kaji, Masaya Yasuda, Katsuki Fujisawa:
CMAP-LAP: Configurable Massively Parallel Solver for Lattice Problems. HiPC 2021: 42-52 - [c35]Yuta Kambe, Yusuke Aikawa, Momonari Kudo, Masaya Yasuda, Katsuyuki Takashima, Kazuhiro Yokoyama:
Implementation Report of the Kohel-Lauter-Petit-Tignol Algorithm for the Constructive Deuring Correspondence. ICMC 2021: 953-966 - [c34]Satoshi Nakamura, Masaya Yasuda:
An Extension of Kannan's Embedding for Solving Ring-Based LWE Problems. IMACC 2021: 201-219 - [c33]Yasuhiko Ikematsu, Satoshi Nakamura, Masaya Yasuda:
A Trace Map Attack Against Special Ring-LWE Samples. IWSEC 2021: 3-22 - 2020
- [j15]Masaya Yasuda, Satoshi Nakamura, Junpei Yamaguchi:
Analysis of DeepBKZ reduction for finding short lattice vectors. Des. Codes Cryptogr. 88(10): 2077-2100 (2020) - [j14]Huy Quoc Le, Pradeep Kumar Mishra, Satoshi Nakamura, Koha Kinjo, Dung Hoang Duong, Masaya Yasuda:
Impact of the modulus switching technique on some attacks against learning problems. IET Inf. Secur. 14(3): 286-303 (2020) - [j13]Masaya Yasuda:
Self-dual DeepBKZ for finding short lattice vectors. J. Math. Cryptol. 14(1): 84-94 (2020) - [j12]Kazuhiro Yokoyama, Masaya Yasuda, Yasushi Takahashi, Jun Kogure:
Complexity bounds on Semaev's naive index calculus method for ECDLP. J. Math. Cryptol. 14(1): 460-485 (2020) - [c32]Yasuhiko Ikematsu, Ryoya Fukasaku, Momonari Kudo, Masaya Yasuda, Katsuyuki Takashima, Kazuhiro Yokoyama:
Hybrid Meet-in-the-Middle Attacks for the Isogeny Path-Finding Problem. APKC@AsiaCCS 2020: 36-44 - [c31]Satoshi Nakamura, Nariaki Tateiwa, Koha Kinjo, Yasuhiko Ikematsu, Masaya Yasuda, Katsuki Fujisawa:
Solving the Search-LWE Problem by Lattice Reduction over Projected Bases. ICMC 2020: 29-42 - [c30]Satoshi Nakamura, Yasuhiko Ikematsu, Masaya Yasuda:
Dynamic Self-dual DeepBKZ Lattice Reduction with Free Dimensions. ICMC 2020: 377-391 - [c29]Nariaki Tateiwa, Yuji Shinano, Satoshi Nakamura, Akihiro Yoshida, Shizuo Kaji, Masaya Yasuda, Katsuki Fujisawa:
Massive parallelization for finding shortest lattice vectors based on ubiquity generator framework. SC 2020: 60
2010 – 2019
- 2019
- [j11]Masaya Yasuda, Junpei Yamaguchi:
A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths. Des. Codes Cryptogr. 87(11): 2489-2505 (2019) - 2018
- [c28]Masaya Yasuda, Junpei Yamaguchi, Michiko Ooka, Satoshi Nakamura:
Development of a Dual Version of DeepBKZ and Its Application to Solving the LWE Challenge. AFRICACRYPT 2018: 162-182 - [c27]Huy Quoc Le, Pradeep Kumar Mishra, Dung Hoang Duong, Masaya Yasuda:
Solving LWR via BDD Strategy: Modulus Switching Approach. CANS 2018: 357-376 - [c26]Momonari Kudo, Yuki Yokota, Yasushi Takahashi, Masaya Yasuda:
Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation. CANS 2018: 377-393 - [c25]Deevashwer Rathee, Pradeep Kumar Mishra, Masaya Yasuda:
Faster PCA and Linear Regression through Hypercubes in HElib. WPES@CCS 2018: 42-53 - [i4]Pradeep Kumar Mishra, Deevashwer Rathee, Dung Hoang Duong, Masaya Yasuda:
Fast Secure Matrix Multiplications over Ring-Based Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2018: 663 (2018) - [i3]Deevashwer Rathee, Pradeep Kumar Mishra, Masaya Yasuda:
Faster PCA and Linear Regression through Hypercubes in HElib. IACR Cryptol. ePrint Arch. 2018: 801 (2018) - 2017
- [j10]Masaya Yasuda:
Secure Hamming distance computation for biometrics using ideal-lattice and ring-LWE homomorphic encryption. Inf. Secur. J. A Glob. Perspect. 26(2): 85-103 (2017) - [j9]Masaya Yasuda, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, Takeshi Koshiba:
Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors. J. Math. Cryptol. 11(1): 1-24 (2017) - [j8]Keiji Kimura, Hayato Waki, Masaya Yasuda:
Application of mixed integer quadratic program to shortest vector problems. JSIAM Lett. 9: 65-68 (2017) - [c24]Yutaro Kiyomura, Akiko Inoue, Yuto Kawahara, Masaya Yasuda, Tsuyoshi Takagi, Tetsutaro Kobayashi:
Secure and Efficient Pairing at 256-Bit Security Level. ACNS 2017: 59-79 - [c23]Pradeep Kumar Mishra, Dung Hoang Duong, Masaya Yasuda:
Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption. ISPEC 2017: 320-330 - [c22]Masaya Yasuda, Takeshi Shimoyama, Masahiko Takenaka, Narishige Abe, Shigefumi Yamada, Junpei Yamaguchi:
Recovering Attacks Against Linear Sketch in Fuzzy Signature Schemes of ACNS 2015 and 2016. ISPEC 2017: 409-421 - [c21]Dung Hoang Duong, Masaya Yasuda, Tsuyoshi Takagi:
Choosing Parameters for the Subfield Lattice Attack Against Overstretched NTRU. ISC 2017: 79-91 - [c20]Junpei Yamaguchi, Masaya Yasuda:
Explicit Formula for Gram-Schmidt Vectors in LLL with Deep Insertions and Its Applications. NuTMiC 2017: 142-160 - [p1]Masaya Yasuda:
Simple Analysis of Key Recovery Attack Against LWE. CREST Crypto-Math Project 2017: 221-238 - [i2]Dung Hoang Duong, Masaya Yasuda, Tsuyoshi Takagi:
Choosing Parameters for the Subfield Lattice Attack against overstretched NTRU. IACR Cryptol. ePrint Arch. 2017: 959 (2017) - 2016
- [j7]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Tetsuya Izu:
Computational hardness of IFP and ECDLP. Appl. Algebra Eng. Commun. Comput. 27(6): 493-521 (2016) - [c19]Momonari Kudo, Junpei Yamaguchi, Yang Guo, Masaya Yasuda:
Practical Analysis of Key Recovery Attack Against Search-LWE Problem. IWSEC 2016: 164-181 - 2015
- [j6]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba:
New packing method in somewhat homomorphic encryption and its applications. Secur. Commun. Networks 8(13): 2194-2213 (2015) - [j5]Masaya Yasuda, Yuka Sugimura:
Biometric key-binding using lattice masking†. Secur. Commun. Networks 8(18): 3405-3414 (2015) - [c18]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba:
Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption. ACISP 2015: 471-487 - [c17]Masaya Yasuda, Takeshi Koshiba, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama:
Secure Data Devolution: Practical Re-encryption with Auxiliary Data in LWE-based Somewhat Homomorphic Encryption. SCC@ASIACCS 2015: 53-61 - [c16]Avradip Mandal, Arnab Roy, Masaya Yasuda:
Comprehensive and Improved Secure Biometric System Using Homomorphic Encryption. DPM/QASA@ESORICS 2015: 183-198 - [c15]Masaya Yasuda, Takeshi Shimoyama, Narishige Abe, Shigefumi Yamada, Takashi Shinzaki, Takeshi Koshiba:
Privacy-Preserving Fuzzy Commitment for Biometrics via Layered Error-Correcting Codes. FPS 2015: 117-133 - [i1]Shinya Okumura, Shingo Sugiyama, Masaya Yasuda, Tsuyoshi Takagi:
Security Analysis of Cryptosystems Using Short Generators over Ideal Lattices. IACR Cryptol. ePrint Arch. 2015: 1004 (2015) - 2014
- [j4]Masaya Yasuda, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, Takeshi Koshiba:
On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption. J. Math. Cryptol. 8(3): 305-329 (2014) - [c14]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba:
Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption. ACISP 2014: 338-353 - [c13]Yuka Sugimura, Masaya Yasuda, Shigefumi Yamada, Narishige Abe, Takashi Shinzaki:
A Biometric Key-Binding Scheme Using Lattice Masking. BIOSIG 2014: 211-218 - 2013
- [c12]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba:
Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics. CD-ARES Workshops 2013: 55-74 - [c11]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba:
Secure pattern matching using somewhat homomorphic encryption. CCSW 2013: 65-76 - [c10]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba:
Practical Packing Method in Somewhat Homomorphic Encryption. DPM/SETOP 2013: 34-50 - 2012
- [c9]Masaya Yasuda, Jun Yajima, Takeshi Shimoyama, Jun Kogure:
Analysis of Lattice Reduction Attack against the Somewhat Homomorphic Encryption Based on Ideal Lattices. EuroPKI 2012: 1-16 - [c8]Yumi Sakemi, Goichiro Hanaoka, Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda:
Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve. Public Key Cryptography 2012: 595-608 - [c7]Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Tetsuya Izu:
On the Strength Comparison of the ECDLP and the IFP. SCN 2012: 302-325 - 2011
- [j3]Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda:
Experimental Analysis of Cheon's Algorithm against Pairing-friendly Curves. Inf. Media Technol. 6(4): 1175-1184 (2011) - [j2]Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda:
Experimental Analysis of Cheon's Algorithm against Pairing-friendly Curves. J. Inf. Process. 19: 441-450 (2011) - [c6]Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda:
Experimantal Analysis of Cheon's Algorithm Against Pairing-Friendly Curves. AINA 2011: 90-96 - [c5]Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda:
Time Estimation of Cheon's Algorithm over Elliptic Curves on Finite Fields with Characteristic 3. IMIS 2011: 594-596 - [c4]Yumi Sakemi, Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda:
Solving a DLP with Auxiliary Input with the ρ-Algorithm. WISA 2011: 98-108 - [c3]Yumi Sakemi, Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda:
Solving DLP with Auxiliary Input over an Elliptic Curve Used in TinyTate Library. WISTP 2011: 116-127 - 2010
- [c2]Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda:
Experimental Results on Cheon's Algorithm. ARES 2010: 625-628 - [c1]Masaya Yasuda:
The Elliptic Curve Discrete Logarithm Problems over the p-adic Field and Formal Groups. ISPEC 2010: 110-122
2000 – 2009
- 2008
- [j1]Masaya Yasuda:
The discrete logarithm problem on elliptic curves defined over Q (abstract only). ACM Commun. Comput. Algebra 42(1-2): 64-66 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
