Access Restriction

Author Kurt, Yesem
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword New Key Exchange Primitive ♦ Triple Decomposition Problem ♦ Decomposition Problem ♦ Noncommutative Group ♦ Quadratic System ♦ Key Establishment Scheme ♦ New Primitive ♦ Middle Piece ♦ Di Erent Protocol ♦ Scheme Relies ♦ Linear System ♦ Harder Problem
Abstract We present a new key exchange primitive based on the decomposition problem over noncommutative groups. Different from the key establishment schemes that rely on the decomposition problem where the problem is decomposing an element into three parts where the middle piece is known, our scheme relies on decomposing an element into three parts, all unknown. We call this problem "Triple Decomposition Problem". This seems to be a harder problem because it requires quadratic systems to be solved instead of linear systems. We discuss the new primitive over two di#erent protocols. The underlying problems in the two protocols differ slightly. We discuss
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 2006-01-01