Pro Cryptography and Cryptanalysis with C++23: Creating and Programming Advanced Algorithms 2nd Edition Marius Iulian Mihailescu download
Pro Cryptography and Cryptanalysis with C++23: Creating and Programming Advanced Algorithms 2nd Edition Marius Iulian Mihailescu download
https://ebookmeta.com/product/pro-cryptography-and-cryptanalysis-
with-c23-creating-and-programming-advanced-algorithms-2nd-
edition-marius-iulian-mihailescu-2/
https://ebookmeta.com/product/pro-cryptography-and-cryptanalysis-
with-c23-creating-and-programming-advanced-algorithms-2nd-
edition-marius-iulian-mihailescu/
https://ebookmeta.com/product/pro-cryptography-and-cryptanalysis-
with-c-20-creating-and-programming-advanced-algorithms-1st-
edition-marius-iulian-mihailescu/
https://ebookmeta.com/product/progeny-progeny-1-1st-edition-
rebecca-rathe/
The Law of Forensics in Uganda 1st Edition Lubogo Isaac
Christopher
https://ebookmeta.com/product/the-law-of-forensics-in-uganda-1st-
edition-lubogo-isaac-christopher/
https://ebookmeta.com/product/public-service-logic-creating-
value-for-public-service-users-citizens-and-society-through-
public-service-delivery-1st-edition-stephen-p-osborne-2/
https://ebookmeta.com/product/kafka-in-action-final-release-1st-
edition-dylan-scott/
https://ebookmeta.com/product/c20-recipes-a-problem-solution-
approach-2nd-edition-j-burton-browning/
https://ebookmeta.com/product/a-love-so-strong-1st-edition-
sharon-c-cooper/
A Touch of Greed Vices Virtues 1st Edition Matilda
Martel
https://ebookmeta.com/product/a-touch-of-greed-vices-virtues-1st-
edition-matilda-martel/
Marius Iulian Mihailescu and Stefania Loredana Nita
Pro Cryptography and Cryptanalysis
with C++23
Creating and Programming Advanced Algorithms
2nd ed.
Marius Iulian Mihailescu
Bucharest, Romania
This work is subject to copyright. All rights are solely and exclusively
licensed by the Publisher, whether the whole or part of the material is
concerned, specifically the rights of translation, reprinting, reuse of
illustrations, recitation, broadcasting, reproduction on microfilms or in
any other physical way, and transmission or information storage and
retrieval, electronic adaptation, computer software, or by similar or
dissimilar methodology now known or hereafter developed.
The publisher, the authors, and the editors are safe to assume that the
advice and information in this book are believed to be true and accurate
at the date of publication. Neither the publisher nor the authors or the
editors give a warranty, expressed or implied, with respect to the
material contained herein or for any errors or omissions that may have
been made. The publisher remains neutral with regard to jurisdictional
claims in published maps and institutional affiliations.
This Apress imprint is published by the registered company APress
Media, LLC, part of Springer Nature.
The registered company address is: 1 New York Plaza, New York, NY
10004, U.S.A.
Any source code or other supplementary material referenced by the
author in this book is available to readers on GitHub
(https://github.com/Apress). For more detailed information, please
visit http://www.apress.com/source-code.
Table of Contents
Part I: Foundations
Chapter 1:Getting Started in Cryptography and Cryptanalysis
Cryptography and Cryptanalysis
Book Structure
Internet Resources
Forums and Newsgroups
Security Protocols and Standards
Cryptography Tools and Resources
Conclusion
References
Chapter 2:Cryptography Fundamentals
Information Security and Cryptography
Cryptography Goals
Cryptographic Primitives
Background of Mathematical Functions
One-to-One, One-Way, and Trapdoor One-Way Functions
Permutations
Inclusion
Concepts and Basic Terminology
Domains and Codomains Used for Encryption
Encryption and Decryption Transformations
The Participants in the Communication Process
Digital Signatures
Signing Process
Verification Process
Public-Key Cryptography
Hash Functions
Case Studies
Caesar Cipher Implementation in C++23
Vigenére Cipher Implementation in C++23
Conclusion
References
Chapter 3:Mathematical Background and Its Applicability
Probabilities
Conditional Probability
Random Variables
Birthday Problem
Information Theory
Entropy
Number Theory
Integers
Algorithms inℤ
Integers Modulo n
Algorithms ℤm
The Legendre and Jacobi Symbols
Finite Fields
Basic Notions
Polynomials and the Euclidean Algorithm
Case Study 1:Computing the Probability of an Event That Takes
Place
Case Study 2:Computing the Probability Distribution
Case Study 3:Computing the Mean of the Probability
Distribution
Case Study 4:Computing the Variance
Case Study 5:Computing the Standard Deviation
Case Study 6:Birthday Paradox
Case Study 7:(Extended) Euclidean Algorithm
Case Study 8: Computing the Multiplicative Inverse Under
Modulo q
Case Study 9:Chinese Remainder Theorem
Case Study 10:The Legendre Symbol
Conclusion
References
Chapter 4:Large Integer Arithmetic
A Bit of History
What About Cryptography?
Algorithms Used for Large Integer Arithmetic
Subtraction (Subtraction Modulo)
Multiplication
Big Integers
Review of Large Integer Libraries
Conclusion
References
Chapter 5:Floating-Point Arithmetic
Why Floating-Point Arithmetic?
Displaying Floating-Point Numbers
The Range of Floating Points
Floating-Point Precision
Next Level for Floating-Point Arithmetic
Conclusion
References
Chapter 6:New Features in C++23
Headers
The <expected> Header
The <generator> Header
The <flat_map> Header
Conclusion
References
Chapter 7:Secure Coding Guidelines
Secure Coding Checklist
CERT Coding Standards
Identifiers
Noncompliant Code Examples and Compliant Solutions
Exceptions
Risk Assessment
Automated Detection
Related Guidelines
Rules
Rule 01.Declarations and Initializations (DCL)
Rule 02.Expressions (EXP)
Rule 03.Integers (INT)
Rule 05.Characters and Strings (STR)
Rule 06.Memory Management (MEM)
Rule 07.Input/Output (FIO)
Conclusion
References
Chapter 8:Cryptography Libraries in C/C++23
Overview of Cryptography Libraries
Hash Functions
Public-Key Cryptography
Elliptic-Curve Cryptography (ECC)
OpenSSL
Configuration and Installing OpenSSL
Botan
CrypTool
Conclusion
References
Part II: Pro Cryptography
Chapter 9:Elliptic-Curve Cryptography
Theoretical Fundamentals
Weierstrass Equation
Group Law
Practical Implementation
Conclusion
References
Chapter 10:Lattice-based Cryptography
Advantages and Disadvantages of Lattice-based Cryptography
Applications of Lattice-based Cryptography
Security of Lattice-based Cryptography
Lattice-based Cryptography and Quantum Computing
Mathematical Background
Example
Conclusion
References
Chapter 11:Searchable Encryption
Components
Entities
Types
Security Characteristics
An Example
Conclusion
References
Chapter 12:Homomorphic Encryption
Full Homomorphic Encryption
A Practical Example of Using FHE
Conclusion
References
Chapter 13:Ring Learning with Errors Cryptography
Mathematical Background
Learning with Errors (LWE)
Ring Learning with Errors (RLWE)
Practical Implementation
Conclusion
References
Chapter 14:Chaos-based Cryptography
Security Analysis
Chaotic Maps for Plaintexts and Image Encryption
Rössler Attractor
Complex Numbers:A Short Overview
Practical Implementation
Secure Random Number Generator Using Chaos Rössler
Attractor
Encrypt and Decrypt Using Chaos and Fractals
Conclusion
References
Chapter 15:Big Data Cryptography
Verifiable Computation
Conclusion
References
Chapter 16:Cloud Computing Cryptography
A Practical Example
Conclusion
References
Part III: Pro Cryptanalysis
Chapter 17:Starting with Cryptanalysis
Part III:Structure
Cryptanalysis Terms
A Bit of Cryptanalysis History
Understanding Cryptanalysis Techniques
Analyzing Cryptographic Algorithms
Cracking Cryptographic Systems
Understanding Cryptographic Systems
Understanding Cryptographic Keys
Understanding Cryptographic Weaknesses
Analyzing Cryptographic Keys
Penetration Tools and Frameworks
Conclusion
References
Chapter 18:Cryptanalysis Attacks and Techniques
Standards
FIPS 140-2, FIPS 140-3, and ISO 15408
Validation of Cryptographic Systems
Cryptanalysis Operations
Classification of Cryptanalytics Attacks
Attacks on Cipher Algorithms
Attacks on Cryptographic Keys
Attacks on Authentication Protocols
Conclusion
References
Chapter 19:Differential and Linear Cryptanalysis
Differential Cryptanalysis
Linear Cryptanalysis
Performing Linear Cryptanalysis
Conclusion
References
Chapter 20:Integral Cryptanalysis
Basic Notions
Theorem 20-1 [1, Theorem 1, p.114]
Theorem 20-2 [1, Theorem 2, p.114]
Practical Approach
Conclusion
References
Chapter 21:Brute-Force and Buffer Overflow Attacks
Brute-Force Attack
Buffer Overflow Attack
Conclusion
References
Chapter 22:Text Characterization
Chi-Squared Statistic
Cryptanalysis Using Monogram, Bigram, and Trigram
Frequency Counts
Counting Monograms
Counting Bigrams
Counting Trigrams
Conclusion
References
Chapter 23:Implementation and Practical Approach of
Cryptanalysis Methods
Step 1
Step 2
Step 3
Step 4
Ciphertext-Only Attack (COA)
Known-Plaintext Attack (KPA)
Chosen-Plaintext Attack (CPA)
Chosen-Ciphertext Attack (CCA)
Conclusion
References
Index
About the Authors
Marius Iulian Mihailescu, PhD
is an associate professor at the Faculty of Engineering and Informatics,
Spiru Haret University in Bucharest, Romania. He is also the CEO of
Dapyx Solution Ltd., a company based in Bucharest specializing in
information security and cryptography-related research projects. He is
a lead guest editor for applied cryptography journals and a reviewer for
multiple publications with information security and cryptography
profiles. He authored and co-authored more articles in conference
proceedings, 25 articles, and books. For more than six years, he has
been a lecturer at well-known national and international universities
(the University of Bucharest, Titu Maiorescu University, and Kadir Has
University in Istanbul, Turkey). He has taught courses on programming
languages (C#, Java, C++, Haskell) and object-oriented system analysis
and design with UML, graphs, databases, cryptography, and information
security. He served three years as an IT officer at Royal Caribbean
Cruises Ltd., dealing with IT infrastructure, data security, and satellite
communications systems. He received his PhD in 2014, and his thesis
was on applied cryptography over biometrics data. He holds two MSc in
information security and software engineering.
References
[1]. Alkim, E., Ducas, L., Pö ppelmann, T., and Schwabe, P. (2016). Postquantum key
exchange—a new hope. In 25th {USENIX} Security Symposium ({USENIX}
Security 16) (pp. 327–343).
[2].
Peikert, C. (2014, October). Lattice cryptography for the Internet. In
international workshop on postquantum cryptography (pp. 197–219). Springer,
Cham.
[3].
Brakerski, Z., Gentry, C., and Vaikuntanathan V. (2011). Fully Homomorphic
Encryption without Bootstrapping Cryptology ePrint Archive, Paper 2011/277,
https://eprint.iacr.org/2011/277.
[4].
Stallings, W., Cryptography and Network Security - Principles and Practice. 5
ed. 2010: Pearson. 744.
[5].
Reddit. Cryptography News and Discussions. Available from:
https://www.reddit.com/r/crypto/.
[6].
Forums, Security.; Available from: http://www.security-
forums.com/index.php?
sid=acc302c71bb3ea3a7d631a357223e261.
[7].
TechGenix, Security. Available from: http://techgenix.com/security/.
[8].
Wilders Security Forums. Available from:
https://www.wilderssecurity.com/.
[9].
Security Focus. Available from: https://www.securityfocus.com/.
[10].
Security InfoWatch. Available from:
https://forums.securityinfowatch.com/ .
[11].
TechRepublic – Security. Available from:
https://www.techrepublic.com/forums/security/.
[12].
Information Security Forum. Available from:
https://www.securityforum.org/.
Footnotes
1 See
https://www.bsi.bund.de/SharedDocs/Downloads/EN/BSI/Publicati
ons/TechGuidelines/TG02102/BSI-TR-02102-1.pdf?
__blob=publicationFile&v=6
2 See
https://www.bsi.bund.de/SharedDocs/Downloads/EN/BSI/Publicati
ons/TechGuidelines/TG02102/BSI-TR-02102-2.pdf?
__blob=publicationFile&v=5
3 See
https://www.bsi.bund.de/SharedDocs/Downloads/EN/BSI/Publicati
ons/TechGuidelines/TG02102/BSI-TR-02102-3.pdf?
__blob=publicationFile&v=5
4 See
https://www.bsi.bund.de/SharedDocs/Downloads/EN/BSI/Publicati
ons/TechGuidelines/TG02102/BSI-TR-02102-4.pdf?
__blob=publicationFile&v=5
© The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature 2023
M. I. Mihailescu, S. L. Nita, Pro Cryptography and Cryptanalysis with C++23
https://doi.org/10.1007/978-1-4842-9450-5_2
2. Cryptography Fundamentals
Marius Iulian Mihailescu1 and Stefania Loredana Nita1
(1) Bucharest, Romania
Cryptographic history is incredibly long and fascinating. The Code Book: The Secrets Behind Codebreaking [1]
is a comprehensive reference that provides a nontechnical history of cryptography. In the book, the story of
cryptography begins in approximately 2000 BC, when the Egyptians used it for the first (known) time. It
presents the main aspects of cryptography and hiding information for each period that is covered and
describes the great contribution that cryptography had in both world wars. The art of cryptography often
correlates with diplomacy, military, and government because its purpose is to keep sensitive data, such as
strategies or secrets regarding national security, safe.
A crucial development in modern cryptography is the working paper “New Directions in Cryptography”
[2] proposed by Diffie and Hellman in 1976. The paper introduced a notion that changed how cryptography
was seen until then, namely, public-key cryptography. Another important contribution of this paper is an
innovative way of exchanging keys. The security of the presented technique is based on the hardness
assumption (basically, through the hardness assumption, we refer to a problem that cannot be solved
efficiently) of the discrete logarithm problem. Even though the authors did not propose a practical
implementation for their public-key encryption scheme, the idea was presented very clearly and started to
draw attention in the international cryptography community.
The first implementation of a public-key encryption scheme was made in 1978 by Rivest, Shamir, and
Adleman, who proposed and implemented their encryption scheme, currently known as RSA [3]. The
hardness assumption in the RSA is the factoring of large integers. By looking in parallel between integer
factorization for RSA and Shor’s algorithm, we can note that Shor’s algorithm runs in polynomial time for
quantum computers. This represents a significant challenge for any cryptographer using the hardness
assumption for factoring large integers. The increasing applications and interest in the factoring problem led
to new techniques. Important advances in this area were made in 1980, but none of the proposed techniques
improved the security of the RSA.
Another important class of practical public-key encryption schemes was designed by ElGamal [4] in
1985. These are based on the hardness assumption of the discrete logarithm problem.
Other crucial contributions to public-key cryptography are the digital signature, for which the
international standard ISO/IEC 9796 was adopted in 1991 [5]. The basis of the standard is the RSA public-
key encryption scheme. A powerful scheme for digital signatures based on the discrete logarithm hardness
assumption is the Digital Signature Standard, adopted by the United States government in 1994.
Currently, the trends in cryptography include designing and developing new public key schemes, adding
improvements to the existing cryptographic mechanisms, and elaborating security proofs.
The book’s objective is to provide a view of the latest updates of the principles, techniques, algorithms,
and implementations of the most important aspects of cryptography in practice. It focuses on the practical
and applied aspects of cryptography. You are warned about the difficult subjects and those that present
issues and are guided to a proper bibliography in which best practices and solutions are found. Most of the
aspects presented in the book are followed by implementations. This objective also serves to not obscure the
real nature of cryptography. The book represents strong material for both implementers and researchers.
The book describes the algorithms and software systems with their interactions.
Information Security and Cryptography
This book refers to the term and concept of information as to quantity. To go through the introduction to
cryptography and to show its applicability by presenting algorithms and implementation technologies (such
as C++), first, we need to have a basis for the issues that occur often in information security. When a
particular transaction occurs, all parties involved must be sure (or ensure) that specific objectives related to
information security are met. A list of these security objectives is given in Table 2-1.
Several protocols and security mechanisms have been proposed to defy the issues regarding information
security when the information is sent in physical format (for example, documents). The objectives regarding
information security may be accomplished by applying mathematical algorithms or work protocols to
information that needs to be protected and additionally following specific procedures and laws. An example
of physical document protection is sealed envelopes (the mechanism of protection) that cover the letter (the
information that needs to be protected) delivered by an authorized mail service (the trusted party). In this
example, the protection mechanism has its limitations. But the technical framework has rigorous rules,
through which any entity that opens the envelope and does not have this right needs to be punished. There
are situations in which the physical paper contains the information that needs to be protected, and has
special characteristics that certify the originality of the data/information. For example, to refrain from
forging banknotes, paper currency has special ink and matter.
From a conceptual point of view, how the information is manipulated did not change substantially. We
consider storing, registering, interpreting, and recording data. However, a manipulation that changed
significantly is copying and modifying the information. An important concept in information security is the
signature, which represents the foundation for more processes, such as nonrepudiation, data origin
authentication, identification, and witnessing.
The requirements introduced by legal and technical skills should be followed to achieve the security of
information in electronic communication. On the other hand, the preceding protection objectives are not
guaranteed to be fulfilled accordingly. The technical part of information security is assured by cryptography.
Cryptography represents the field that studies the mathematical techniques and tools that are connected
to information security, such as confidentiality, integrity (data), authentication (entity), and the origin of
authentication. Cryptography not only provides information security but also provides a specific set of
techniques.
Cryptography Goals
From the security objectives presented in Table 2-1, the following represent a basis from which the others
can be derived.
privacy/confidentiality (Definitions 2.5 and 2.8)
data integrity (Definition 2.9)
authentication (Definition 2.7)
nonrepudiation (Definition 2.6)
The following explains each of the four objectives in detail.
Confidentiality represents a service that protects information content from unauthorized entities and
access. Confidentiality is assured through different techniques, from mathematical algorithms to physical
protection, that scramble the data into an incomprehensible form.
Data integrity represents a service that prevents unauthorized alteration of the information. Authorized
entities should be able to discover and identify unauthorized manipulation of data.
Authentication represents a service that has an important role when data or application is authenticated,
and it implies identification. The authentication process is applied on both extremities that use the data
(for example, the sender and the receiver). The rule is that each involved party should identify itself in the
communication process. It is very important that both parties that are involved in the communication
process declare to each other their identity (the parties could be represented by a person or a system). At
the same time, some characteristics of the data should accompany the data itself; for example, its origin,
content, or the time of creation/sending. From this point of view, cryptography branches authentication
into two categories: authentication of the entity and authentication of the data origin. Data origin
authentication leads to data integrity.
Nonrepudiation represents a service that prevents the denials of previous actions made by an entity.
When a conflict occurs because an entity denies its previous actions, it is resolved by an existing sinew
showing the actions made over data.
One of the main goals of cryptography is to fulfill the four objectives on both sides—theory and practice.
Cryptographic Primitives
The book presents several fundamental cryptographic tools called primitives. Examples of primitives are
encryption schemes (Definitions 2.5 and 2.8), hash functions (Definition 2.9), and schemes for digital
signatures (Definition 2.6). Figure 2-1 presents a schematic description of these primitives and their
relationship. Many cryptographic primitives are used in the book, and practical implementations are
provided every time. Before using them in real-life applications, the primitives should be evaluated to check
if the following criteria are fulfilled.
Level of security. It is slightly difficult to quantify the level of security. However, it can be quantified as
the number of operations to accomplish the desired objective. The level of security is usually defined
based on the superior bound given by the volume of work necessary to defeat the objective.
Functionality. To accomplish security objectives, in many situations, primitives are combined. You need
to be sure that they work properly.
Operation methods. When primitives are used, they need different inputs and have different ways of
working, resulting in different characteristics. In these situations, the primitives provide very different
functionalities that depend on the mode of operation.
Random documents with unrelated
content Scribd suggests to you:
kaltaiseksi, jotka tyytyvät etäisyydestä ja ylimalkaisesti harrastamaan
vapautta ja edistystä.
Elin rouvan olennossa oli näet jotakin, joka vaikutti siltä kuin saisi
hän itse merenkin tyyntymään.
*****
Ja hän voi piirustaa tuntikausia, jos vain sai istua pienen pöydän
ääressä Veran maalaustelineitten vieressä.
Kaikki mitä Vera omisti oli jollakin tavoin erikoista. Eivät edes
hänen pukimensa olleet samanlaiset kuin muiden.
*****
Eräänä iltana aikoi Falck ehdottaa Vera rouvalle että he menisivät
kävelyretkelle lammikolle katsomaan lohenmullonpoikasia.
Tuomarin katse seurasi häntä, kun hän nyt kulki yli lattian. Hän
ihmetteli hänen liikkeidensä kauneutta ja kuinka miellyttävältä ja
suurenmoiselta hän vaikutti.
Vera hymyili. Mutta kun hän loi silmänsä tuomariin, näki tämä
kuinka kiihkeä niiden katse oli — ja täynnä tuskaa.
Falck olisi halunnut pyytää anteeksi että oli häirinnyt, mutta Vera
keskeytti hänet.
Hän alkoi epäillä ettei koulu, mihin Gunn oli joutunut, ollut hänelle
hyödyksi.
Falck ei vastannut.
Tuomari ei ollut samaa mieltä. Mutta nyt halusi hän lähteä täyttä
totta. Hän seisoi kynnyksellä.
Falck jatkoi matkaansa. Hän ei pitänyt siitä että Vera illoin kulki
hänen asuntonsa ulkopuolella, kuunnellen hänen soittoansa. Hän ei
voinut sietää sitä että häntä millään tavoin tarkattiin. Hän tahtoi
pitää oman itsensä rauhassa muilta.
Sitten ei Vera ollut tehnyt sitä enää koskaan toiste. Mutta nyt
tuntui tuomarista epäilyttävältä, oliko tuo seurustelu oikeastaan
hyödyllistä Pikku-Gunnille.
Elin rouvaa ja häntä oli usein huvittanut tarkata, kuinka lapsi väliin
voi katsoa Veraan ikäänkuin äidillisen anteeksiantavasti. Ja kun
Veran tykönä kävi rajuilma, pakeni hän tädin turviin.
12.
Nyt kävi kaikki niin rauhallisesti ja hyvin. Usein ei hän tiennyt, oliko
hänen laskeminen vuosien vai kuukausien kulkua.
Siksi oli täti kirjoittanut rikkaille ihmisille, joita tunsi. Hän oli varma
että he kaikki tahtoivat auttaa, kun vain saivat asiasta tietoa.
Ainoa, joka aavisti jotain, oli Pikku-Gunn. Eräänä päivänä tuli hän
kesken opetustuntien tädin luo. — Täti, en voi olla Veran luona, hän
on niin pahalla tuulella — hän on saanut kirjeen… istun sinun luonasi
kutomassa viininlehtiä. Saat ne, kun ne valmistuvat! Mutta kuinka
onkaan laitasi, täti?
Mutta täti pani kovasti vastaan, niin että hänen kasvonsa kävivät
yhä punaisemmiksi.
Samassa tuli Torgersen sisään. Hän oli käynyt erään lähellä asuvan
sairaan tykönä ja tuli sattumalta käymään kartanossa.
Kun hän nyt istui kuunnellen tätiä, kävi hänen mielensä raskaaksi
— sillä entisyyden jättämät jäljet olivat syvät.
Hän oli saanut viestin. Kun jonkun piti kuolla Herön kartanossa,
tuli siitä aina tieto edeltäpäin.
*****
— Et saa mennä… ei, sinun pitää nyt kuunnella… sillä näetkö, kun
aika menee menojaan, silloin kasvaa kaipaus niin kiihkeäksi… kaikki
ihmisluonnon kaiho pyrkii tavottamaan sitä, jota ei kukaan saavuta…
Hän uskoi nyt asiansa Lydrikille. Tämä nauroi, sillä hän nauroi aina
— varsinkin kaikelle surulliselle.
Silloin kiintyi tädin katse häneen äkkiä. Hänen silmänsä olivat niin
surulliset, että Pikku-Gunn alkoi itkeä.
Morten oli Elin rouvan iso kissa, joka aina pysytteli tädin
kintereillä. Nyt se makasi liikkumatonna sängyn vieressä, ikäänkuin
olisi tiennyt mistä oli kysymys.
Äkkiä valtasi pelko jälleen tädin mielen. Hän aukoi silmiään hurjan
tuskan vallassa. — Minkätähden tulee niin pimeä… miksi käy myrsky
yli maan!… minne voin piiloutua?
— Heillä on Kristus!
Pikku-Gunn oli noussut ja seisoi tädin edessä. Hän oli niin varma
asiastaan.
— Sinä voimakas Isä, joka olet sekä isämme että äitimme, tule
tänne ja pidä meistä huolta!
Lydrik tuli sisään. Hän oli ensin odottanut alhaalla, mutta oli sitten
noussut tikapuita ylös ja tullut sisään. Hiljaa lähestyi hän vuodetta ja
seisoi nauraen, kyynelten virratessa kasvoja pitkin. Hänestä oli niin
kauheata — melkein samanlaista kuin silloin kun hänen äitinsä kuoli
ja suru täytti koko elämän. Täti ei nähnyt häntä. Hän ei nähnyt enää
ketään.
Kului tunti.
13.
Mutta eipä hänestä juuri näyttänyt siltä, että Gunn olisi sitä
huomannutkaan. Oli aivan kuin Pikku-isä olisi tykkänään häipynyt
hänen muististansa.
*****
Totta oli, että hänellä oli paljon ajateltavaa. Tobine oli pyytänyt
häntä tulemaan illoin vuorelle häntä tapaamaan. Hän oli luvannut
Jumalan edessä täyttää hänen pyyntönsä.
Tuo ajatus täytti hänen mielensä. Aina oli hänellä ollut se käsitys,
että kun hän tuli suureksi, määräisi Jumala itse hänelle hänen
työalansa.
*****
Hänen täytyi muistella sitä aikaa, jolloin hän itse oli nuori ja ensi
kerran näki Gunvor Torintyttären.
Merellä oli ollut niin paljon laivoja. Hän oli nähnyt niiden tulevan ja
menevän.
Ja kaikki nuo kirjeet, joita Vera sai, ne herättivät hänessä
levottomuutta — pikimmiten toivomuksen että hänellä olisi siivet,
millä lentää pois.
Nyt oli täti poissa. Mutta nythän hän jo oli niin suuri, että hänen
kaiketi piti tulla toimeen omin päin.
Mutta Veran olennossa oli kumminkin jotain, joka oli kuin ruokaa
ja juomaa nuorelle kyllästymättömälle mielelle. Hänessä oli jotain
meren kaltaista. Mitä Gunn kuuli hänen elämästään, se muistutti
myöskin merta. Siksi rakasti hän häntä.
Kerran tuli tuomari heidän luoksensa ja oli hilpeällä mielellä ja laski
leikkiä. — No, kuinkas käy, kysyi hän, — saatteko te hänet
totutetuksi ihmistavoille? Nähkääs, hänhän on oikeastaan vain
lintunen.
*****
Sitten tuli hän ajatelleeksi mitä Vera kerran oli sanonut, nimittäin
että kirkko ja pappi kyllä voivat olla hyvät olemassa, mutta että jos
hän tahtoi tietää minne maailman suuri viisaus oli kätketty, niin
sisältyi se valtavaan rakennukseen, jonka taivas ja meri ja maa
muodostivat. — - Suurella alttarilla tuolla ulkona olivat pyhät kirjat
esillä… jokainen voi lukea niitä, eikä ihminen voinut mistään kuten
niistä oppia elämään Jumalan kasvojen edessä.
Hän alkoi katsella ympäristöään toisin silmin kuin ennen. Kuinka oli
oikein ihmisten laita? — —
Mutta eihän hän itse liene ollut sen parempi kuin muutkaan!
Tuo ajatus sai hänet kauhistumaan. Nuo toiset, ne eivät tienneet
millaisia olivat. Mitähän Jeesus ajattelikaan kaikesta tästä maailman
itsetyytyväisestä synnillisyydestä, hän, joka oli tullut sytyttämään
tulen, hävittääkseen kaiken halpamaisen — —
Tänä talvena oli niillä seuduin perustettu uusi lahko. Sillä oli
nimenä "Sionin lapset". Perustajat olivat kaksi etelästä tullutta
jumalanmiestä. He puhuivat joka ilta.
*****
*****
*****