Results 1 to 10 of about 70,954 (220)

The relevance of introducing the basics of cryptography and the basics of information security in the school course in computer science

Management of Education, 2023
Актуальность данной темы обусловлена потребностью в специалистах в области информационной безопасности. Внедрение в школьный курс информатики основ криптографии может значительно повлиять на выбор профессии и качество специалистов в области защиты информации.
А.С. Зуфарова, Ю.С. Бузыкова, А.Д. Бурыкина   +2 more
semanticscholar   +4 more sources

Special issue of computers and mathematics with applications on “Advances in cryptography, security and applications for future computer science”

Computers & Mathematics with Applications, 2010
Yi Mu, Guilin Wang, Jong Hyuk Park, Sajid Hussain   +3 more
semanticscholar   +4 more sources

Principles of Security and Trust: 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings [PDF]

, 2020
authentication; computer science; computer software selection and evaluation; cryptography; data privacy; formal logic; formal methods; formal specification; internet; privacy; program compilers; programming languages; security analysis ...

core   +1 more source

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction [PDF]

, 2016
Pairing based cryptography is in a dangerous position following the breakthroughs on discrete logarithms computations in finite fields of small characteristic.
A Commeine, A Guillevic, A Joux, A Joux, A Joux, A Menezes, A Miyaji, D Boneh, D Boneh, D Coppersmith, D Freeman, D Freeman, F Brezing, G Frey, IF Blake, J Beuchat, K Foster, LM Adleman, O Schirokauer, O Schirokauer, P Sarkar, P Sarkar, PSLM Barreto, R Barbulescu, R Barbulescu, R Barbulescu, R Dupont, R Granger, RM Elkenbracht-Huizing, SD Galbraith, T Hayashi, T Kim, Y Bistritz, Y Sakemi   +33 more
core   +5 more sources

Rancang Bangun Aplikasi Keamanan Data Menggunakan Metode AES pada Smartphone [PDF]

, 2017
Cryptography is one technique used to improve the security aspects of information. Cryptography is the study of science and art to maintain a message or data information so that the data is safe.
Hasibuan, A. M. (Amir)
core   +2 more sources

The Case for Quantum Key Distribution [PDF]

, 2009
Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems. We argue that QKD will be an important part of future cryptographic infrastructures.
A.R. Dixon, D. Atkins, D. Gottesman, D. Mayers, D. Mayers, G. Brassard, H.J. Briegel, H.K. Lo, J. Barrett, J.M. Perdigues Armengol, K.G. Paterson, M. Peev, M.A. Nielsen, M.N. Wegman, P.A. Hiskett, R.Y.Q. Cai, S. Pironio, T. Schmitt-Manderbach, T.R. Beals, W.Y. Hwang, Y. Zhao   +20 more
core   +8 more sources

Analysis of the Security of BB84 by Model Checking [PDF]

, 2010
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols.
Azizi, Abdelmalek, Azizi, Mostafa, Elboukhari, Mohamed   +2 more
core   +2 more sources

Cloud Computing in the Quantum Era [PDF]

, 2019
Cloud computing has become the prominent technology of this era. Its elasticity, dynamicity, availability, heterogeneity, and pay as you go pricing model has attracted several companies to migrate their businesses' services into the cloud.
Kaiiali, Mustafa, Khalid, Ayesha, Sezer, Sakir   +2 more
core   +2 more sources

Ubic: Bridging the gap between digital cryptography and the physical world

, 2014
Advances in computing technology increasingly blur the boundary between the digital domain and the physical world. Although the research community has developed a large number of cryptographic primitives and has demonstrated their usability in all ...
D.M. Freeman, J. Katz, K. Mikolajczyk, L. D’Antoni, R. Cramer, R. Smith, S.B. Wicker   +6 more
core   +1 more source

A Formalization of Polytime Functions [PDF]

, 2011
We present a deep embedding of Bellantoni and Cook's syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to the original characterization by Cobham that required a bound to be proved manually ...
Heraud, Sylvain, Nowak, David
core   +5 more sources