Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- Article
How to Forge a Time-Stamp Which Adobe’s Acrobat Accepts
AbstractThis paper shows how to forge a time-stamp which the latest version of Adobe’s Acrobat and Acrobat Reader accept improperly. The target signature algorithm is RSASSA-PKCS1-v1_5 with a 1024-bit public composite and the public key e = 3, and our ...
- article
Computational hardness of IFP and ECDLP
Applicable Algebra in Engineering, Communication and Computing, Volume 27, Issue 6•December 2016, pp 493-521 • https://doi.org/10.1007/s00200-016-0291-xThe RSA cryptosystem and elliptic curve cryptography (ECC) have been used practically and widely in public key cryptography. The security of RSA and ECC respectively relies on the computational hardness of the integer factorization problem (IFP) and the ...
- article
New packing method in somewhat homomorphic encryption and its applications
Security and Communication Networks, Volume 8, Issue 13•September 2015, pp 2194-2213 • https://doi.org/10.1002/sec.1164Somewhat homomorphic encryption is public key encryption supporting a limited number of additions and multiplications on encrypted data. This encryption gives a powerful tool in performing meaningful computations with protecting data confidentiality, ...
- research-article
Secure Data Devolution: Practical Re-encryption with Auxiliary Data in LWE-based Somewhat Homomorphic Encryption
SCC '15: Proceedings of the 3rd International Workshop on Security in Cloud Computing•April 2015, pp 53-61• https://doi.org/10.1145/2732516.2732521Homomorphic encryption can support meaningful operations on encrypted data, and hence it enables users to outsource their data in encrypted format to cloud services. However, homomorphic encryption cannot operate on ciphertexts with different keys in ...
- research-article
Secure pattern matching using somewhat homomorphic encryption
CCSW '13: Proceedings of the 2013 ACM workshop on Cloud computing security workshop•November 2013, pp 65-76• https://doi.org/10.1145/2517488.2517497The basic pattern matching problem is to find the locations where a pattern occurs in a text. Recently, secure pattern matching has been received much attention in various areas, including privacy-preserving DNA matching and secure biometric ...
- Article
Practical Packing Method in Somewhat Homomorphic Encryption
Revised Selected Papers of the 8th International Workshop on Data Privacy Management and Autonomous Spontaneous Security - Volume 8247•September 2013, pp 34-50• https://doi.org/10.1007/978-3-642-54568-9_3Somewhat homomorphic encryption is public key encryption supporting a limited number of both additions and multiplications on encrypted data, which is useful for performing fundamental computations with protecting the data confidentiality. In this paper,...
- Article
Breaking pairing-based cryptosystems using ηT pairing over GF(397)
ASIACRYPT'12: Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security•December 2012, pp 43-60• https://doi.org/10.1007/978-3-642-34961-4_5In this paper, we discuss solving the DLP over GF(36·97) by using the function field sieve (FFS) for breaking paring-based cryptosystems using the ηT pairing over GF(397). The extension degree 97 has been intensively used in benchmarking tests for the ...
- Article
Analysis of Lattice Reduction Attack against the Somewhat Homomorphic Encryption Based on Ideal Lattices
EuroPKI 2012: Revised Selected Papers of the 9th European Workshop on Public Key Infrastructures, Services and Applications - Volume 7868•September 2012, pp 1-16• https://doi.org/10.1007/978-3-642-40012-4_1In 2009, Gentry first proposed a concrete method for constructing a fully homomorphic encryption FHE scheme, which supports arbitrary operations on encrypted data. The construction of the FHE scheme starts from a somewhat homomorphic encryption SHE ...
- Article
On the strength comparison of the ECDLP and the IFP
SCN'12: Proceedings of the 8th international conference on Security and Cryptography for Networks•September 2012, pp 302-325• https://doi.org/10.1007/978-3-642-32928-9_17At present, the RSA cryptosystem is most widely used in public key cryptography. On the other hand, elliptic curve cryptography (ECC) has recently received much attention since smaller ECC key sizes provide the same security level as RSA. Although there ...
- Article
Key length estimation of pairing-based cryptosystems using ηT pairing
ISPEC'12: Proceedings of the 8th international conference on Information Security Practice and Experience•April 2012, pp 228-244• https://doi.org/10.1007/978-3-642-29101-2_16The security of pairing-based cryptosystems depends on the difficulty of the discrete logarithm problem (DLP) over certain types of finite fields. One of the most efficient algorithms for computing a pairing is the ηT pairing over supersingular curves ...
- Article
Preimage attacks on Full-ARIRANG: analysis of DM-Mode with middle feed-forward
WISA'11: Proceedings of the 12th international conference on Information Security Applications•August 2011, pp 40-54• https://doi.org/10.1007/978-3-642-27890-7_4In this paper, we present preimage attacks on hash function ARIRANG, which is one of the first round candidates in the SHA-3 competition. Although ARIRANG was not chosen for the second round, the vulnerability as a hash function has not been discovered ...
- Article
Preimage attacks on full-ARIRANG
ACISP'11: Proceedings of the 16th Australasian conference on Information security and privacy•July 2011, pp 417-422This paper presents ongoing work toward the first preimage attacks on hash function ARIRANG, which is one of the first round candidates in the SHA-3 competition. ARIRANG has an unique design where the feed-forward operation is computed not only after ...
- Article
Matrix representation of conditions for the collision attack of SHA-1 and its application to the message modification
IWSEC'10: Proceedings of the 5th international conference on Advances in information and computer security•November 2010, pp 267-284In this paper, we propose a matrix representation of Chaining Variable Condition (CVC) and Message Condition (MC) for the collision attack on the hash function SHA-1. Then we apply this to an algorithm for constructing the Message Modification procedure ...
- Article
Preimage attacks on step-reduced RIPEMD-128 and RIPEMD-160
Inscrypt'10: Proceedings of the 6th international conference on Information security and cryptology•October 2010, pp 169-186This paper presents the first results on the preimage resistance of ISO standard hash functions RIPEMD-128 and RIPEMD-160. They were designed as strengthened versions of RIPEMD. While preimage attacks on the first 33 steps and intermediate 35 steps of ...
- Article
CAIRN: Dedicated Integer Factoring Devices
NBIS '10: Proceedings of the 2010 13th International Conference on Network-Based Information Systems•September 2010, pp 558-563• https://doi.org/10.1109/NBiS.2010.60The integer factoring problem is known as one of the hard problem in cryptology, and some public-key cryptosystems including RSA are designed based of this fact. Recently, several dedicated integer factoring devices have been proposed, however, no ...
- research-article
A strict evaluation method on the number of conditions for the SHA-1 collision search
ASIACCS '08: Proceedings of the 2008 ACM symposium on Information, computer and communications security•March 2008, pp 10-20• https://doi.org/10.1145/1368310.1368316This paper proposes a new algorithm for evaluating the number of chaining variable conditions(CVCs) in the selecting step of a distrubance vector (DV) for the analysis of SHA-1 collision attack. The algorithm is constructed by combining the following ...
- Article
How to forge a time-stamp which adobe's acrobat accepts
Cryptography and Coding'07: Proceedings of the 11th IMA international conference on Cryptography and coding•December 2007, pp 54-72This paper shows how to forge a time-stamp which the latest version of Adobe's Acrobat and Acrobat Reader accept improperly. The target signature algorithm is RSASSA-PKCS1-v1 5 with a 1024-bit public composite and the public key e = 3, and our ...
- Article
Experiments on the linear algebra step in the number field sieve
IWSEC'07: Proceedings of the Security 2nd international conference on Advances in information and computer security•October 2007, pp 58-73This paper shows experimental results of the linear algebra step in the number field sieve on parallel environment with implementation techniques. We developed an efficient algorithm that shares the sum of vectors in each node, and the network structure ...
- Article
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
CHES '07: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems•September 2007, pp 364-377• https://doi.org/10.1007/978-3-540-74735-2_25The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient algorithm for factoring large integers currently, is a threat for such ...
- Article
A new strategy for finding a differential path of SHA-1
ACISP'07: Proceedings of the 12th Australasian conference on Information security and privacy•July 2007, pp 45-58In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path of Round 1 is very complex, and it takes much time to find one by hand. ...
