Bu çalışmada kuantum sonrası şifreleme sistem ailelerinden biri olan çok değişkenli polinom sistemlerine dayanan ABC kriptosistemi anlatılmaktadır. Günümüzde kullanılan açık anahtarlı şifreleme sistemlerinin zorluğu çarpanlara ayırma ve ayrık logaritma problemlerine dayanmaktadır. Kuantum bilgisayarlar yeterli büyüklüğe ulaştıkları zaman bu problemleri kullanan şifreleme yöntemleri güvensiz duruma gelecektir. Bu sebeple kuantum bilgisayarlarda çalışan kriptanaliz yöntemlerine karşı dirençli kriptosistemlerin geliştirilmesine ve bunların farklı platformlardaki uygulamalarına ihtiyaç vardır. Çalışmada öncelikle ABC kriptosisteminde kullanılan matematiksel altyapı anlatılmış ve sonrasında ABC kriptosisteminin teorik yapısı hatırlatılmıştır. Bu...
Background. People use the Internet for communication, work, online banking and more. Public-key cry...
Abstract: Contemporary cryptographic algorithms are resistant to the strongest threats to cybersecur...
Polynomial system solving is one of the oldest and most important problems incomputational mathemati...
In the light of technological advances, scientists expect that quantum computers will be generated a...
Moderna kriptografija može se podijeliti u dvije velike skupine kriptografskih algoritama: simetričn...
Quantum computation is a new computational model based on quantum mechanical principle. Shor invente...
Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2003Thesis (M.Sc.) -- ...
Cryptographic techniques are essential for the security of communication in modern society. As more ...
Práce má za cíl seznámit s kvantovými počítači a prozkoumat jejích dopady na asymetrickou kryptograf...
Bu tezde NIST çağrısında sunulan kod tabanlı bazı anahtar kapsülleme mekanizmaları ve şifreleme algo...
This bachelor thesis deals with the possibilities of quantum computatutions and their use in cryptan...
One emerging threat to Public Key Infrastructures is the possible development of large-scale quantum...
The existing certificateless signcryption schemes were designed mainly based on the traditional publ...
The existing certificateless signcryption schemes were designed mainly based on the traditional publ...
Most public key cryptosystems used in practice are based on integer factorization or discrete logari...
Background. People use the Internet for communication, work, online banking and more. Public-key cry...
Abstract: Contemporary cryptographic algorithms are resistant to the strongest threats to cybersecur...
Polynomial system solving is one of the oldest and most important problems incomputational mathemati...
In the light of technological advances, scientists expect that quantum computers will be generated a...
Moderna kriptografija može se podijeliti u dvije velike skupine kriptografskih algoritama: simetričn...
Quantum computation is a new computational model based on quantum mechanical principle. Shor invente...
Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2003Thesis (M.Sc.) -- ...
Cryptographic techniques are essential for the security of communication in modern society. As more ...
Práce má za cíl seznámit s kvantovými počítači a prozkoumat jejích dopady na asymetrickou kryptograf...
Bu tezde NIST çağrısında sunulan kod tabanlı bazı anahtar kapsülleme mekanizmaları ve şifreleme algo...
This bachelor thesis deals with the possibilities of quantum computatutions and their use in cryptan...
One emerging threat to Public Key Infrastructures is the possible development of large-scale quantum...
The existing certificateless signcryption schemes were designed mainly based on the traditional publ...
The existing certificateless signcryption schemes were designed mainly based on the traditional publ...
Most public key cryptosystems used in practice are based on integer factorization or discrete logari...
Background. People use the Internet for communication, work, online banking and more. Public-key cry...
Abstract: Contemporary cryptographic algorithms are resistant to the strongest threats to cybersecur...
Polynomial system solving is one of the oldest and most important problems incomputational mathemati...