Making Cryptographic Primitives Harder
スポンサーリンク
概要
- 論文の詳細を見る
This paper studies a method for transforming ordinary cryptographic primitives to new harder primitives. Such a method is expected to lead to general schemes that make present cryptosystems secure against the attack of quantum computers. We propose a general technique to construct a new function from an ordinary primitive function f with a help of another hard function g so that the resulting function is to be new hard primitives. We call this technique a lifting of f by g. We show that the lifted function is harder than original functions under some simple conditions.
- （社）電子情報通信学会の論文
- 2008-01-01
著者
-
Koizumi Eisuke
Department of Earth and Planetary Science, Graduate School of Science, University of Tokyo
-
HASEGAWA Shingo
Department of Computer and Mathematical Sciences, Graduate School of Information Sciences, Tohoku Un
-
SHIZUYA Hiroki
Department of Computer and Mathematical Sciences, Graduate School of Information Sciences, Tohoku Un
-
Shizuya Hiroki
Department Of Computer And Mathematical Sciences The Graduate School Of Information Sciences Tohoku
-
Shizuya Hiroki
Department Of Computer And Mathematical Sciences Graduate School Of Information Sciences Tohoku Univ
-
Koizumi Eisuke
Department Of Computer And Mathematical Sciences The Graduate School Of Information Sciences Tohoku
-
Hasegawa Shingo
Department Of Computer And Mathematical Sciences The Graduate School Of Information Sciences Tohoku
-
Hasegawa Shingo
Department Of Computer And Mathematical Sciences Graduate School Of Information Sciences Tohoku Univ
-
HATANAKA Hiroyuki
Department of Computer and Mathematical Sciences, the Graduate School of Information Sciences, Tohok
-
Hatanaka Hiroyuki
Department Of Computer And Mathematical Sciences The Graduate School Of Information Sciences Tohoku
関連論文
- Yamato 980459: Mineralogy and petrology of a new shergottite-related rock from Antarctica
- NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization
- On the Difficulty of Searching for a String without Decryption (Special Section on Cryptography and Information Security)
- Making Cryptographic Primitives Harder
- Toward Separating Integer Factoring from Discrete Logarithm mod p(Foundations,Cryptography and Information Security)
- On the Polynomial Time Computability of Abstract Ray-Tracing Problems(Discrete Mathematics and Its Applications)
- Gastrointestinal Stromal Tumor with Two Genetic Abnormalities on Different Alleles : Report of a Case
- Mineralogy and petrology of Yamato 000593: Comparison with other Martian nakhlite meteorites
- Comparative mineralogy of magmatic inclusions in olivine from the Chassigny and Nakhla martian meteorites
- Origin of olivine megacrysts and the groundmass crystallization of the Dar al Gani 476 shergottite
- Cardiomyopathy with Hereditary Cerebellar Ataxia Report of an Autopsied Case
- On the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions
- On the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions