Atsushi Takayasu

Orcid: 0000-0002-9310-6976

According to our database1, Atsushi Takayasu authored at least 41 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
More Efficient Adaptively Secure Lattice-Based IBE with Equality Test in the Standard Model.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

On the Untapped Potential of the Quantum FLT-based Inversion.
IACR Cryptol. ePrint Arch., 2024

Attribute-based Keyed (Fully) Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2024

2023
A Generic Construction of CCA-Secure Identity-Based Encryption with Equality Test against Insider Attacks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023

L1-norm ball for CSIDH: Optimal strategy for choosing the secret key space.
Discret. Appl. Math., March, 2023

Concrete Quantum Cryptanalysis of Binary Elliptic Curves via Addition Chain.
IACR Cryptol. ePrint Arch., 2023

A Lattice Attack on CRYSTALS-Kyber with Correlation Power Analysis.
IACR Cryptol. ePrint Arch., 2023

Memory-Efficient Quantum Information Set Decoding Algorithm.
Proceedings of the Information Security and Privacy - 28th Australasian Conference, 2023

2022
Erratum: A Compact Digital Signature Scheme Based on the Module-LWR Problem [IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Vol. E104.A (2021), No. 9 pp.1219-1234].
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

Keyed-Fully Homomorphic Encryption without Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2022

2021
Revocable identity-based encryption with bounded decryption key exposure resistance: Lattice-based construction and more.
Theor. Comput. Sci., 2021

A Compact Digital Signature Scheme Based on the Module-LWR Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

More Efficient Adaptively Secure Revocable Hierarchical Identity-based Encryption with Compact Ciphertexts: Achieving Shorter Keys and Tighter Reductions.
IACR Cryptol. ePrint Arch., 2021

Generic Constructions of Revocable Hierarchical Identity-based Encryption.
IACR Cryptol. ePrint Arch., 2021

A Generic Construction of CCA-secure Attribute-based Encryption with Equality Test.
IACR Cryptol. ePrint Arch., 2021

Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity.
Des. Codes Cryptogr., 2021

Tag-based ABE in prime-order groups via pair encoding.
Des. Codes Cryptogr., 2021

Efficient identity-based encryption with Hierarchical key-insulation from HIBE.
Des. Codes Cryptogr., 2021

Adaptively secure revocable hierarchical IBE from k-linear assumption.
Des. Codes Cryptogr., 2021

2020
Extended partial key exposure attacks on RSA: Improvement up to full size decryption exponents.
Theor. Comput. Sci., 2020

Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance.
Theor. Comput. Sci., 2020

On the Complexity of the LWR-Solving BKW Algorithm.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

L<sub>1</sub>-Norm Ball for CSIDH: Optimal Strategy for Choosing the Secret Key Space.
IACR Cryptol. ePrint Arch., 2020

Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes.
Discret. Appl. Math., 2020

2019
Partial key exposure attacks on RSA: Achieving the Boneh-Durfee bound.
Theor. Comput. Sci., 2019

Generalized cryptanalysis of small CRT-exponent RSA.
Theor. Comput. Sci., 2019

Small CRT-Exponent RSA Revisited.
J. Cryptol., 2019

Explicit Relation between Low-Dimensional LLL-Reduced Bases and Shortest Vectors.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

2018
Tight Reductions for Diffie-Hellman Variants in the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2018

Estimated Cost for Solving Generalized Learning with Errors Problem via Embedding Techniques.
Proceedings of the Advances in Information and Computer Security, 2018

2017
General Bounds for Small Inverse Problems and Its Applications to Multi-Prime RSA.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Lattice-based Revocable Identity-based Encryption with Bounded Decryption Key Exposure Resistance.
IACR Cryptol. ePrint Arch., 2017

2016
A Tool Kit for Partial Key Exposure Attacks on RSA.
IACR Cryptol. ePrint Arch., 2016

How to Generalize RSA Cryptanalyses.
IACR Cryptol. ePrint Arch., 2016

Partial Key Exposure Attacks on CRT-RSA: General Improvement for the Exposed Least Significant Bits.
Proceedings of the Information Security - 19th International Conference, 2016

Small secret exponent attacks on RSA with unbalanced prime factors.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs.
Proceedings of the Information Security and Privacy - 21st Australasian Conference, 2016

2015
Tighter Security for Efficient Lattice Cryptography via the Rényi Divergence of Optimized Orders.
IACR Cryptol. ePrint Arch., 2015

Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents.
Proceedings of the Applied Cryptography and Network Security, 2015

2014
Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Cryptanalysis of RSA with Multiple Small Secret Exponents.
Proceedings of the Information Security and Privacy - 19th Australasian Conference, 2014


  Loading...