Discrete Mathematics with Cryptographic Applications : A Self-Teaching Introduction |
Autore | Kheyfits Alexander I |
Pubbl/distr/stampa | Bloomfield : , : Mercury Learning & Information, , 2021 |
Descrizione fisica | 1 online resource (382 pages) |
Disciplina | 510 |
Soggetto topico | COMPUTERS / Security / Cryptography |
Soggetto non controllato |
computer science
cryptography discrete math finite mathematics |
ISBN |
1-68392-761-3
1-68392-762-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter 1: A Brief Survey of Elementary Functions -- Chapter 2: Propositional Algebra -- Chapter 3: Naïve and Formal (Axiomatic) Set Theory -- Chapter 4: Groups, Rings, and Fields -- Chapter 5: Predicates and Quantifiers—Algebraic Theory -- Chapter 6: Binary Relations and Relational Databases -- Chapter 7: Combinatorics -- Chapter 8: Elements of Number Theory -- Chapter 9: Boolean Functions -- Chapter 10: Hashing Functions and Cryptographic Maps -- Chapter 11: Generating Polynomials and Inversion Formulas -- Chapter 12: Systems of Representatives -- Chapter 13: Boolean Algebras -- Chapter 14: Combinatorial Circuits -- Chapter 15: Complete Systems of Boolean Functions and Bases -- Chapter 16: Introductory Graph Theory, Euler’s Formula, and Unbreakable Ciphers -- Chapter 17: Trees and Digraphs -- Chapter 18: Computations and Algorithms -- Chapter 19: Finite Automata -- Chapter 20: Introduction to Game Theory -- Chapter 21: Information Theory and Coding -- Chapter 22: Probability Theory with a Finite Sample Space and the Birthday Problem -- Chapter 23: Turing Machines, P and NP Classes, and Other Models of Computation -- Chapter 24: Answers and Solutions to Selected Exercises -- Bibliography -- Index |
Altri titoli varianti | Discrete Mathematics with Cryptographic Applications |
Record Nr. | UNINA-9910794790503321 |
Kheyfits Alexander I
![]() |
||
Bloomfield : , : Mercury Learning & Information, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Discrete Mathematics with Cryptographic Applications : A Self-Teaching Introduction |
Autore | Kheyfits Alexander I |
Pubbl/distr/stampa | Bloomfield : , : Mercury Learning & Information, , 2021 |
Descrizione fisica | 1 online resource (382 pages) |
Disciplina | 510 |
Soggetto topico | COMPUTERS / Security / Cryptography |
Soggetto non controllato |
computer science
cryptography discrete math finite mathematics |
ISBN |
1-68392-761-3
1-68392-762-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter 1: A Brief Survey of Elementary Functions -- Chapter 2: Propositional Algebra -- Chapter 3: Naïve and Formal (Axiomatic) Set Theory -- Chapter 4: Groups, Rings, and Fields -- Chapter 5: Predicates and Quantifiers—Algebraic Theory -- Chapter 6: Binary Relations and Relational Databases -- Chapter 7: Combinatorics -- Chapter 8: Elements of Number Theory -- Chapter 9: Boolean Functions -- Chapter 10: Hashing Functions and Cryptographic Maps -- Chapter 11: Generating Polynomials and Inversion Formulas -- Chapter 12: Systems of Representatives -- Chapter 13: Boolean Algebras -- Chapter 14: Combinatorial Circuits -- Chapter 15: Complete Systems of Boolean Functions and Bases -- Chapter 16: Introductory Graph Theory, Euler’s Formula, and Unbreakable Ciphers -- Chapter 17: Trees and Digraphs -- Chapter 18: Computations and Algorithms -- Chapter 19: Finite Automata -- Chapter 20: Introduction to Game Theory -- Chapter 21: Information Theory and Coding -- Chapter 22: Probability Theory with a Finite Sample Space and the Birthday Problem -- Chapter 23: Turing Machines, P and NP Classes, and Other Models of Computation -- Chapter 24: Answers and Solutions to Selected Exercises -- Bibliography -- Index |
Altri titoli varianti | Discrete Mathematics with Cryptographic Applications |
Record Nr. | UNINA-9910826507003321 |
Kheyfits Alexander I
![]() |
||
Bloomfield : , : Mercury Learning & Information, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Electronic Voting : 7th International Joint Conference, e-Vote-ID 2022, Bregenz, Austria, October 4-7, 2022, Proceedings |
Autore | Krimmer Robert |
Pubbl/distr/stampa | Cham, : Springer Nature, 2022 |
Descrizione fisica | 1 online resource (197 pages) |
Altri autori (Persone) |
VolkamerMelanie
Duenas-CidDavid RønnePeter GermannMicha |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Coding theory & cryptology
Information retrieval Artificial intelligence Network security Computer security Network hardware |
Soggetto non controllato |
artificial intelligence
communication communication systems computer crime computer hardware computer networks computer science computer security computer systems computer vision cryptography data security engineering fuzzy sets internet network protocols network security privacy signal processing telecommunication systems |
ISBN | 3-031-15911-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996490356403316 |
Krimmer Robert
![]() |
||
Cham, : Springer Nature, 2022 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Electronic Voting : 7th International Joint Conference, e-Vote-ID 2022, Bregenz, Austria, October 4-7, 2022, Proceedings |
Autore | Krimmer Robert |
Pubbl/distr/stampa | Cham, : Springer Nature, 2022 |
Descrizione fisica | 1 online resource (197 pages) |
Altri autori (Persone) |
VolkamerMelanie
Duenas-CidDavid RønnePeter GermannMicha |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Coding theory & cryptology
Information retrieval Artificial intelligence Network security Computer security Network hardware |
Soggetto non controllato |
artificial intelligence
communication communication systems computer crime computer hardware computer networks computer science computer security computer systems computer vision cryptography data security engineering fuzzy sets internet network protocols network security privacy signal processing telecommunication systems |
ISBN | 3-031-15911-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910590067403321 |
Krimmer Robert
![]() |
||
Cham, : Springer Nature, 2022 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Entropy in Image Analysis II |
Autore | Sparavigna Amelia Carolina |
Pubbl/distr/stampa | Basel, Switzerland, : MDPI - Multidisciplinary Digital Publishing Institute, 2020 |
Descrizione fisica | 1 electronic resource (394 p.) |
Soggetto topico | History of engineering & technology |
Soggetto non controllato |
image binarization
optical character recognition local entropy filter thresholding image preprocessing image entropy image encryption medical color images RGB chaotic system crowd behavior analysis salient crowd motion detection repulsive force direction entropy node strength Pompe disease children quantitative muscle ultrasound texture-feature parametric imaging compound chaotic system S-box image information entropy image chaotic encryption cryptography Latin cube bit cube chosen plaintext attack atmosphere background engine flame infrared radiation detectability image quality evaluation image retrieval pooling method convolutional neural network feature distribution entropy lossless compression pattern classification machine learning malaria infection entropy Golomb–Rice codes image processing image segmentation weld segmentation weld evaluation convolution neural network Python Keras RSNNS MXNet brain-computer interface (BCI) electroencephalography (EEG) motor imagery (MI) continuous wavelet transform (CWT) convolutional neural network (CNN) hyperchaotic system filtering DNA computing diffusion deep neural network data expansion blind image quality assessment saliency and distortion human visual system declining quality data hiding AMBTC steganography stego image dictionary-based coding pixel value adjusting neuroaesthetics symmetry balance complexity chiaroscuro normalized entropy renaissance portrait paintings art history art statistics chaotic systems DNA coding security analysis magnetic resonance images non-maximum suppression object detection key-point detection IoU feature fusion quasi-resonant Rossby/drift wave triads Mordell elliptic curve pseudo-random numbers substitution box nuclear spin generator medical image peak signal-to-noise ratio key space calculation Duchenne muscular dystrophy ultrasound backscattered signals medical imaging neural engineering computer vision crowd motion detection security |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910557433403321 |
Sparavigna Amelia Carolina
![]() |
||
Basel, Switzerland, : MDPI - Multidisciplinary Digital Publishing Institute, 2020 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
The golden ticket [[electronic resource] ] : P, NP, and the search for the impossible / / Lance Fortnow |
Autore | Fortnow Lance <1963-> |
Edizione | [Course Book] |
Pubbl/distr/stampa | Princeton, : Princeton University Press, 2013 |
Descrizione fisica | 1 online resource (189 p.) |
Disciplina | 511.3/52 |
Soggetto topico |
NP-complete problems
Computer algorithms |
Soggetto non controllato |
Facebook
Frenemy Hamiltonian paths Internet Ketan Mulmuley Leonid Levin Martin Hellman NP problem NP problems NP-complete problems NP-complete P versus NP problem P versus NP Richard Feynman Steve Cook Urbana algorithm Whitfield Diffie academic work algebraic geometry algorithm algorithms approximation big data computational problems computer science computers computing cryptography cryptosystem database decryption digital computers efficient algorithms efficient computation encryption factoring fast computers graph isomorphism heuristics linear programming mathematics max-cut network security networking new technologies parallel computation perebor prime numbers problems programming public-key cryptography quantum computers quantum computing quantum cryptography quantum mechanics quantum physical systems research community secret messages social networking data solution teleportation |
ISBN |
1-4008-4661-7
1-299-15656-8 |
Classificazione | COM051300MAT015000MAT017000MAT034000 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1 The Golden Ticket -- Chapter 2 The Beautiful World -- Chapter 3 P and NP -- Chapter 4 The Hardest Problems in NP -- Chapter 5 The Prehistory of P versus NP -- Chapter 6 Dealing with Hardness -- Chapter 7 Proving P ≠ NP -- Chapter 8 Secrets -- Chapter 9 Quantum -- Chapter 10 The Future -- Acknowledgments -- Chapter Notes and Sources -- Index |
Record Nr. | UNINA-9910779319903321 |
Fortnow Lance <1963->
![]() |
||
Princeton, : Princeton University Press, 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
The golden ticket : P, NP, and the search for the impossible / / Lance Fortnow |
Autore | Fortnow Lance <1963-> |
Edizione | [Course Book] |
Pubbl/distr/stampa | Princeton, : Princeton University Press, 2013 |
Descrizione fisica | 1 online resource (189 p.) |
Disciplina | 511.3/52 |
Soggetto topico |
NP-complete problems
Computer algorithms |
Soggetto non controllato |
Facebook
Frenemy Hamiltonian paths Internet Ketan Mulmuley Leonid Levin Martin Hellman NP problem NP problems NP-complete problems NP-complete P versus NP problem P versus NP Richard Feynman Steve Cook Urbana algorithm Whitfield Diffie academic work algebraic geometry algorithm algorithms approximation big data computational problems computer science computers computing cryptography cryptosystem database decryption digital computers efficient algorithms efficient computation encryption factoring fast computers graph isomorphism heuristics linear programming mathematics max-cut network security networking new technologies parallel computation perebor prime numbers problems programming public-key cryptography quantum computers quantum computing quantum cryptography quantum mechanics quantum physical systems research community secret messages social networking data solution teleportation |
ISBN |
1-4008-4661-7
1-299-15656-8 |
Classificazione | COM051300MAT015000MAT017000MAT034000 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1 The Golden Ticket -- Chapter 2 The Beautiful World -- Chapter 3 P and NP -- Chapter 4 The Hardest Problems in NP -- Chapter 5 The Prehistory of P versus NP -- Chapter 6 Dealing with Hardness -- Chapter 7 Proving P ≠ NP -- Chapter 8 Secrets -- Chapter 9 Quantum -- Chapter 10 The Future -- Acknowledgments -- Chapter Notes and Sources -- Index |
Record Nr. | UNINA-9910818849503321 |
Fortnow Lance <1963->
![]() |
||
Princeton, : Princeton University Press, 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Integral Transforms and Operational Calculus |
Autore | Srivastava Hari Mohan |
Pubbl/distr/stampa | MDPI - Multidisciplinary Digital Publishing Institute, 2019 |
Descrizione fisica | 1 electronic resource (510 p.) |
Soggetto non controllato |
infinite-point boundary conditions
nonlinear boundary value problems q-polynomials ?-generalized Hurwitz–Lerch zeta functions Hadamard product password summation formulas Hankel determinant multi-strip Euler numbers and polynomials natural transform fuzzy volterra integro-differential equations zeros fuzzy differential equations Szász operator q)-Bleimann–Butzer–Hahn operators distortion theorems analytic function generating relations differential operator pseudo-Chebyshev polynomials Chebyshev polynomials Mellin transform uniformly convex functions operational methods differential equation ?-convex function Fourier transform q)-analogue of tangent zeta function q -Hermite–Genocchi polynomials Dunkl analogue derivative properties q)-Euler numbers and polynomials of higher order exact solutions encryption spectrum symmetry advanced and deviated arguments PBKDF wavelet transform of generalized functions fuzzy general linear method Lommel functions highly oscillatory Bessel kernel generalized mittag-leffler function audio features the uniqueness of the solution analytic Mittag–Leffler functions Dziok–Srivastava operator Bell numbers rate of approximation Bessel kernel univalent functions inclusion relationships Liouville–Caputo-type fractional derivative tangent polynomials Bernoulli spiral multi-point q -Hermite–Euler polynomials analytic functions Fredholm integral equation orthogonality property Struve functions cryptography Janowski star-like function starlike and q-starlike functions piecewise Hermite collocation method uniformly starlike and convex functions q -Hermite–Bernoulli polynomials generalized functions meromorphic function basic hypergeometric functions fractional-order differential equations q -Sheffer–Appell polynomials integral representations Srivastava–Tomovski generalization of Mittag–Leffler function Caputo fractional derivative Bernoulli symmetric sufficient conditions nonlocal the existence of a solution functions of bounded boundary and bounded radius rotations differential inclusion symmetry of the zero recurrence relation nonlinear boundary value problem Volterra integral equations Ulam stability q)-analogue of tangent numbers and polynomials starlike function function spaces and their duals strongly starlike functions q)-Bernstein operators vibrating string equation ?-generalized Hurwitz-Lerch zeta functions bound on derivatives Janowski convex function volterra integral equation strongly-starlike function Hadamard product (convolution) regular solution generalized Hukuhara differentiability functions with positive real part exponential function q–Bleimann–Butzer–Hahn operators Carlitz-type q-tangent polynomials distributions Carlitz-type q-tangent numbers starlike functions Riemann-Stieltjes functional integral hash K-functional (p Euler truncated-exponential polynomials Maple graphs Hurwitz-Euler eta function higher order Schwarzian derivatives generating functions strongly convex functions Hölder condition multiple Hurwitz-Euler eta function recurrence relations q-starlike functions partial sum Euler and Genocchi polynomials tangent numbers spectral decomposition determinant definition monomiality principle highly oscillatory Hurwitz-Lerch zeta function Adomian decomposition method analytic number theory existence existence of at least one solution symmetric identities modulus of continuity modified Kudryashov method MFCC q-hypergeometric functions differential subordination Janowski functions and Genocchi numbers series representation initial conditions generalization of exponential function upper bound q-derivative (or q-difference) operator DCT Schwartz testing function space anuran calls generalized Kuramoto–Sivashinsky equation Mittag–Leffler function subordination Hardy space convergence Hermite interpolation direct Hermite collocation method q-Euler numbers and polynomials distribution space Apostol-type polynomials and Apostol-type numbers Schauder fixed point theorem fractional integral convolution quadrature rule q)-integers Liouville-Caputo fractional derivative fixed point convex functions Grandi curves tempered distributions higher order q-Euler numbers and polynomials radius estimate |
ISBN | 3-03921-619-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910367743803321 |
Srivastava Hari Mohan
![]() |
||
MDPI - Multidisciplinary Digital Publishing Institute, 2019 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Interactions between Group Theory, Symmetry and Cryptology |
Autore | González Vasco María Isabel |
Pubbl/distr/stampa | MDPI - Multidisciplinary Digital Publishing Institute, 2020 |
Descrizione fisica | 1 electronic resource (164 p.) |
Soggetto non controllato |
NP-Completeness
protocol compiler post-quantum cryptography Reed–Solomon codes key equation euclidean algorithm permutation group t-modified self-shrinking generator ideal cipher model algorithms in groups lightweight cryptography generalized self-shrinking generator numerical semigroup pseudo-random number generator symmetry pseudorandom permutation Berlekamp–Massey algorithm semigroup ideal algebraic-geometry code non-commutative cryptography provable security Engel words block cipher cryptography beyond birthday bound Weierstrass semigroup group theory braid groups statistical randomness tests group-based cryptography alternating group WalnutDSA Sugiyama et al. algorithm cryptanalysis digital signatures one-way functions key agreement protocol error-correcting code group key establishment |
ISBN | 3-03928-803-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910404086703321 |
González Vasco María Isabel
![]() |
||
MDPI - Multidisciplinary Digital Publishing Institute, 2020 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
The once-only principle : the TOOP Project / / editors, Robert Krimmer, Andriana Prentza, Szymon Mamrot |
Autore | Krimmer Robert |
Pubbl/distr/stampa | Cham, : Springer International Publishing AG, 2021 |
Descrizione fisica | 1 online resource (x, 241 pages) : illustrations (some color) |
Altri autori (Persone) |
KrimmerRobert
PrentzaAndriana MamrotSzymon |
Collana | Lecture notes in computer science |
Soggetto topico |
Government information - Law and legislation
Internet in public administration |
Soggetto non controllato |
Computer Applications
Special Purpose and Application-Based Systems Programming Techniques Software Engineering/Programming and Operating Systems Computer Application in Administrative Data Processing Computer and Information Systems Applications Software Engineering access control communication systems computer systems cryptography databases Field Programmable Gate Array (FPGA) gateways (computer networks) information systems internet protocols network protocols object-oriented design object-oriented programming object-oriented programming languages signal processing social networks software architecture software design system architectures Information technology: general issues Expert systems / knowledge-based systems Computer programming / software engineering Operating systems |
ISBN | 3-030-79851-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The Once-Only Principle: A Matter of Trust Implementation of the 'once-only' principle in Europe national approaches Drivers for and Barriers to the Cross-Border Implementation of the Once-Only Princi pleOnce-Only Principle Good Practices in Europ eThe Single Digital Gateway Regulation as an Enabler and Constraint of Once-Only in EuropeLegal Basis and Regulatory Applications of the Once-Only Principle: the Italian CaseTOOP Trust ArchitectureThe Technical challenges in OOP application across the European Union and the TOOP OOP architectureTesting methodology for the TOOP pilotsTOOP pilot experiences: challenges and achievements in implementing once-only in different domains and Member StatesMeasuring the Impact of the Once Only Principle for Businesses Across BordersThe Future of the Once-Only Principle in Europe |
Record Nr. | UNINA-9910488704303321 |
Krimmer Robert
![]() |
||
Cham, : Springer International Publishing AG, 2021 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|