Maciej Nawrocki prezentaja DIETS3 – dokument [*.docx] Maciej Nawrocki Budownictwo matematyka jan nawrocki 47 wyświetleń, stron. Prodziekan ds. nauki i rozwoju kadry, dr Radosław Nawrocki. Prodziekan ds. kształcenia i Andrzej Jan Pluta (kurator). Zakład Malarstwa i Teorii Sztuki, dr hab. Inny – Obcy – Wróg. Swoi i obcy w świadomości młodzieży szkolnej i studenckiej. by: Ewa Nowicka (author) Jan Nawrocki (author). ISBN:
|Published (Last):||10 December 2017|
|PDF File Size:||20.59 Mb|
|ePub File Size:||5.89 Mb|
|Price:||Free* [*Free Regsitration Required]|
Curie-Sklodowskiej 5, Lublin, Poland. Institute of Telecommunications, Warsaw University of Technology, ul. Nadbystrzycka 36b, Lublin, Poland. Konstantynow 1H, Lublin, Poland. Curie-Sklodowskiej 1, Lublin, Poland. Marias 3George C. Polyzos 3Hermann De Meer 1. Kaliskiego 2, Warsaw, Poland. Banacha 2, Warsaw, Poland. Pawinskiego 5B; Warszawa, Poland.
Humanistic and Economics University, ul. Institute of Mathematics, Silesian University of Technology, ul. Kaszubska 23, Gliwice, Nwwrocki. Nadbystrzycka 38, Lublin, Poland. Institute of technology, State Higher Vocational School, ul. Kwietnia nawroki, Szczecin, Poland. Politechniki 1, Warszawa, Poland. Hlinku 1, 74 Nitra Slovakia.
University of Computer Science and Management, ul.
Tarasiuka 2, Kleosin, Poland. Marii Curie-Sklodowskiej 5, Lublin, Poland. Institute of Mathematics, M. Curie-SModowskiej 1, Lublin, Poland.
Curie-SModowskiej Square 1, Poland. Przedmowa – Kryptografia EN: Preface – Matematyla. We introduce the concept of a family of multivariate maps nawrpcki n of K n into itself with invertible decomposition.
If f n is computable in polynomial time then it can be used as the public rule and the invertible decomposition provides a private key in f n based public key infrastructure. Requirements of polynomial ity of degree and density for f n allow to estimate the complexity of encryption procedure for a public user.
Wydział Chemii Uniwersytetu im. Adama Mickiewicza w Poznaniu
The concepts of a stable family and a family of increasing order are motivated by the studies of discrete logarithm problem in the Cremona group. The statement matemmatyka the anwrocki of families of multivariate maps of polynomial degree and polynomial density of increasing order with the invertible decomposition is proved.
The proof is supported by explicite construction which can be used as a new cryptosystem. Maximality of affine group and hidden graph cryptosystems J. Algebra Discrete Math 1 Journal of Problems of Information transmission Theory 2 A tribute to A.
Pełna lista sygnatariuszy listu naukowców polskich do premiera
Zykova on the ocassion of A. Proceedings of the international conferences -Infinite particle systems, Complex systems theory and its application”, Kazimerz Dolny, Poland 2 54 Studies in Nawrocii Intelligence, Springer, Studies in Computational Intelligence Information and Communication Security 24 Let K be a general finite commutative ring.
We construct a new family of stable elements with invertible decomposition. This is the first construction of the family of maps based on walks on the bipartite algebraic graphs defined over Kwhich are not edge transitive. We describe the application of the above mentioned construction for the development of stream ciphers, public key algorithms and key exchange protocols.
The absence of edge transitive group essentially complicates cryptanalysis. Kim Jon-Lark, Peled U. On the key exchange with matrices of large order and graph based nonlinear maps, Proceedings of the conference “Applications of Computer Algebra”, Vlora, Special Issue, 4 4 Information and Communication Security, 24 Assured security is the desirable feature of modern cryptography. Most of modern cryptography primitives have no provably secure constructions. Their safety is defined on the basis of well-known in the given time cryptanalytic attacks.
The duplex construction equipped with one ideal permutation and appropriate security parameters is suitable for building provably secure cryptographic primitives. The constructions can be used for unclassified information of different sensitivity levels protection.
The applications based on the duplex construction can be used for key wrapping, authenticated encryption and can work as a pseudo-random bit sequence generator. They are not covered by any known intellectual property. The dining cryptographers protocol implements a multiple access channel in which senders and recipients are anonymous. A problem is that a malicious participant can disrupt commu- nication by deliberately creating collisions. We propose a computationally secure dining cryptogra- phers protocol with collision resolution that achieves a maximum stable throughput of 0.
Chaum D, The dining cryptographers problem: Unconditional sender and recipient untraceability, Journal of Cryptology, 1 1 Pseudorandom generators, which produce keystreams for stream ciphers by the exclusiveor sum of outputs of alternately clocked linear feedback shift registers, are vulnerable to cryptanalysis.
In order to increase their resistance to attacks, we introduce a non-linear scrambler at the output of these generators. Non-linear feedback shift register plays the role of the scrambler.
In addition, we propose Modified Alternating Step Generator with a non-linear scrambler MASG1S built with non-linear feedback shift register and regularly or irregularly clocked linear feedback shift registers with non-linear filtering functions.
PINs are one of the most popular methods to perform simple and fast user authentication. The main advantage of the PIN is that it is easy to remember and fast to enter. There are, however, some drawbacks. To avoid such problems a novel method of the PIN entering was proposed. Instead of using a numerical keyboard, the PIN may be entered by eye gazes, which is a hands-free, easy and robust technique.
Can you guess my password? Proceedings of the 19th australasian conference on computer-human interaction: Entertaining user interfaces, ACM International Journal of Industrial Ergonomics, 24 6 Proceedings of the 3rd symposium on Usable privacy and security, ACM Proceedings of the 17th Australia conference on Computer-Human Interaction: In this paper the combination of fingerprint verification methods with watermarking technology to provide copyright protection and authentication of digital images is proposed.
The goal of this study is to investigate how watermarking processing affects the quality of biometric watermarks. Performed experiments showed that extracted fingerprint images have roughly equal verification performance even if some watermarked images undergo additional degradation.
Proposed methodology will be improved using more sophisticated fingerprint verification methods and subsequently incorporated into multimodal watermarking schemes.
Fingerprint Verification Competitionavailable at http: Last decades the contextual approach became an important methodology of analysing information processes in the dynamic environment. In this paper we propose a context management framework suitable for secure network services.
The framework allows tracking the contextual information from its origin, through all stages of its processing up to application in security services protecting the secure network application. RA, 14 May Keller, A. Ad Hoc and Ubiquitous Computing 2 4 Ninth Symposium on Usable Privacy and Secrecy Contextual Service Adaptation Framework, http: A system, which uses context information is a new trend in IT.
IP PAS – Spin Phenomena Physics (SL – )
A lot of researchers create frameworks, which collect some data and perform actions based on them. Recently, there have been observed more and more different security solutions, in which we can use context. But not each works dynamically and ensures a high level of user’s quality of experience QoE. This paper outlines what the context information is and shows a secure and user-friendly authentication mechanism for a mail box in cloud computing, based on using contextual data.
Theory and Applications An adaptive authentication service based on mobile user’s behavior and spatio-temporal context, Brazil Card payments are getting more and more popular across the world.
The most frequently used Cardholder Verification Method in EMV transaction is PIN, which requires from the payment terminal to be equipped with pinpad – which increases the cost of the whole payment device. The key advantage of the presented mechanism is that it can be easily implemented in currently utilized authorization protocols, it does not affect rules of EMV specification and may decrease nwrocki of transaction processing.