Since Diffie and Hellman proposed the concept of key agreement protocols (KAP) and public key cryptosystems (PKC) in 1976, various KAP and PKC were proposed. The typical examples of KAP and PKC are almost based on the factoring problem of large integers, the discrete logarithm problem over finite fields and the elliptic curve discrete logarithm problem. It is said that these problems are efficiently solved in a polynomial time by quantum computers. This book presents some KAP that are the fundamental cryptographic primitives with enciphering and digital signature for the secure communication. The main issue of this book is the proposal of three new KAP over the non-commutative ring. I attached a simple numerical example of KAP for reader to understand the procedure of making common keys. Three proposed KAP are based on the computational difficulty for solving the multivariate algebraic equations of high degree to be one of NP problems. To break these KAP we probably need to solve the multivariate algebraic equations of high degree. Then proposed KAP seem to be immune from the attacks by quantum computers. This book is written for graduate students to active researchers.
"synopsis" may belong to another edition of this title.
Masahiro Yagisawa received the B.E. and M.E. degrees from the University of Tokyo in 1974 and 1976. I am a member of IEICE (The Institute of Electronics, Information and Communication Engineers), IPSJ (Information Processing Society of Japan) and JSIAM (The Japan Society for Industrial and Applied Mathematics).
"About this title" may belong to another edition of this title.
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Since Diffie and Hellman proposed the concept of key agreement protocols (KAP) and public key cryptosystems (PKC) in 1976, various KAP and PKC were proposed. The typical examples of KAP and PKC are almost based on the factoring problem of large integers, the discrete logarithm problem over finite fields and the elliptic curve discrete logarithm problem. It is said that these problems are efficiently solved in a polynomial time by quantum computers. This book presents some KAP that are the fundamental cryptographic primitives with enciphering and digital signature for the secure communication. The main issue of this book is the proposal of three new KAP over the non-commutative ring. I attached a simple numerical example of KAP for reader to understand the procedure of making common keys. Three proposed KAP are based on the computational difficulty for solving the multivariate algebraic equations of high degree to be one of NP problems. To break these KAP we probably need to solve the multivariate algebraic equations of high degree. Then proposed KAP seem to be immune from the attacks by quantum computers. This book is written for graduate students to active researchers. 72 pp. Englisch. Seller Inventory # 9783845403786
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 72. Seller Inventory # 26128852689
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 72 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Seller Inventory # 131702030
Quantity: 4 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Yagisawa MasahiroMasahiro Yagisawa received the B.E. and M.E. degrees from the University of Tokyo in 1974 and 1976. I am a member of IEICE (The Institute of Electronics, Information and Communication Engineers), IPSJ (Information Pr. Seller Inventory # 5480533
Quantity: Over 20 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 72. Seller Inventory # 18128852699
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Since Diffie and Hellman proposed the concept of key agreement protocols (KAP) and public key cryptosystems (PKC) in 1976, various KAP and PKC were proposed. The typical examples of KAP and PKC are almost based on the factoring problem of large integers, the discrete logarithm problem over finite fields and the elliptic curve discrete logarithm problem. It is said that these problems are efficiently solved in a polynomial time by quantum computers. This book presents some KAP that are the fundamental cryptographic primitives with enciphering and digital signature for the secure communication. The main issue of this book is the proposal of three new KAP over the non-commutative ring. I attached a simple numerical example of KAP for reader to understand the procedure of making common keys. Three proposed KAP are based on the computational difficulty for solving the multivariate algebraic equations of high degree to be one of NP problems. To break these KAP we probably need to solve the multivariate algebraic equations of high degree. Then proposed KAP seem to be immune from the attacks by quantum computers. This book is written for graduate students to active researchers.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 72 pp. Englisch. Seller Inventory # 9783845403786
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Since Diffie and Hellman proposed the concept of key agreement protocols (KAP) and public key cryptosystems (PKC) in 1976, various KAP and PKC were proposed. The typical examples of KAP and PKC are almost based on the factoring problem of large integers, the discrete logarithm problem over finite fields and the elliptic curve discrete logarithm problem. It is said that these problems are efficiently solved in a polynomial time by quantum computers. This book presents some KAP that are the fundamental cryptographic primitives with enciphering and digital signature for the secure communication. The main issue of this book is the proposal of three new KAP over the non-commutative ring. I attached a simple numerical example of KAP for reader to understand the procedure of making common keys. Three proposed KAP are based on the computational difficulty for solving the multivariate algebraic equations of high degree to be one of NP problems. To break these KAP we probably need to solve the multivariate algebraic equations of high degree. Then proposed KAP seem to be immune from the attacks by quantum computers. This book is written for graduate students to active researchers. Seller Inventory # 9783845403786
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Proposal for New Key Agreement Protocols | Key Agreement Protocols Immune from Quantum Computer Attacks | Masahiro Yagisawa | Taschenbuch | 72 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783845403786 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 106909133